<--- Back to Details
First PageDocument Content
Logic programming / Type theory / Dependently typed programming / Programming language theory / Automated theorem proving / Higher-order abstract syntax / Lambda calculus / Substitution / Standard ML / Env / Normalisation by evaluation
Date: 2005-08-15 15:31:55
Logic programming
Type theory
Dependently typed programming
Programming language theory
Automated theorem proving
Higher-order abstract syntax
Lambda calculus
Substitution
Standard ML
Env
Normalisation by evaluation

Fundamenta Informaticae–19 1 IOS Press

Add to Reading List

Source URL: www.cs.bu.edu

Download Document from Source Website

File Size: 123,78 KB

Share Document on Facebook

Similar Documents

Logic programming / Type theory / Dependently typed programming / Programming language theory / Automated theorem proving / Higher-order abstract syntax / Lambda calculus / Substitution / Standard ML / Env / Normalisation by evaluation

Fundamenta Informaticae–19 1 IOS Press

DocID: 1pzZ3 - View Document

Lambda calculus / Normalisation by evaluation

Microsoft Word - Midlands Graduate School 2009.doc

DocID: 1pvqt - View Document

Type theory / Models of computation / Symbol / Lambda calculus / Greek alphabet / Type constructor / Curry–Howard correspondence / Normalisation by evaluation / Theoretical computer science / Mathematics / Computer science

Self-Representation in Girard’s System U Keywords Lambda Calculus; Self Representation; Types 1.

DocID: 1g42s - View Document

Computer science / Models of computation / Applied mathematics / Logic in computer science / Normalisation by evaluation / Denotational semantics / De Bruijn index / Symbol / Administrative normal form / Theoretical computer science / Lambda calculus / Programming language semantics

BRICS RS-05-4 Filinski & Rohde: Denotational Aspects of Untyped Normalization by Evaluation BRICS Basic Research in Computer Science

DocID: 1fMbR - View Document