A calculus of mobile processes, II
Information and Computation
From λσ to λν: a journey through calculi of explicit substitutions
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ML for the working programmer (2nd ed.)
ML for the working programmer (2nd ed.)
Term rewriting and all that
Operational reasoning for functions with local state
Higher order operational techniques in semantics
Theoretical Computer Science
Open Proofs and Open Terms: A Basis for Interactive Logic
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A Metalanguage for Programming with Bound Names Modulo Renaming
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Theoretical Computer Science
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Capture-avoiding substitution as a nominal algebra
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
A simpler proof theory for nominal logic
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms
Information and Computation
PNL to HOL: From the logic of nominal sets to the logic of higher-order functions
Theoretical Computer Science
| Hi-index | 0.00 |
We present a simple but expressive lambda-calculus whose syntax is populated by variables which behave like meta-variables. It can express both capture-avoiding and capturing substitution (instantiation). To do this requires several innovations, including a key insight in the confluence proof and a set of reduction rules which manages the complexity of a calculus of contexts over the 'vanilla' lambda-calculus in a very simple and modular way. This calculus remains extremely close in look and feel to a standard lambda-calculus with explicit substitutions, and good properties of the lambda-calculus are preserved.