A calculus of lambda calculus contexts

Journal of Automated Reasoning

Volumn 27, Issue 1, 2001, Pages 29-59

  Bognar, Mirna ^a   De Vrijer, Roel ^a  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Context calculus; Lambda calculus; Pretyping

Indexed keywords

COMPUTER SIMULATION; NATURAL LANGUAGE PROCESSING SYSTEMS; SEMANTICS;

CONTEXT CALCULUS; LAMBDA CALCULUS;

CONTEXT SENSITIVE LANGUAGES;

EID: 0035398286     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1010654904735     Document Type: Article

References (23)

1. Explict substitutions
2. Lambda calculus extended with segments
3. Lambda calculus extended with segments: Chapter 1, Sections 1.1 and 1.2 (Introduction)
4. Primitive recursion for higher-order abstract syntax
5. A typed context calculus
6. Context rewriting
7. Enriching the lambda calculus with contexts: Toward a theory of incremental program construction
8. An algorithm for checking incomplete proof objects in type theory with localization and unification
9. Computing with contexts
10. Dependent types with explicit substitutions: A metatheoretical development
11. Orthogonal higher-order rewrite systems are confluent
12. Development of closed critical pairs
13. Comparing combinatory reduction systems and higher-order rewrite systems
14. Higher-order abstract syntax
15. Computing with contexts, a simple approach
16. Explicit environments
17. Binding structures