A logic programming language with Lambda-abstraction, function variables, and simple unification
Proceedings of the international workshop on Extensions of logic programming
Notions of computation and monads
Information and Computation
Imperative functional programming
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
A lambda-calculus for dynamic binding
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
Operational reasoning for functions with local state
Higher order operational techniques in semantics
Theoretical Computer Science
Template meta-programming for Haskell
Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
Principal type-schemes for functional programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
A Fully Abstract Game Semantics for General References
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Dynamic rebinding for marshalling and update, with destruct-time ?
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Theoretical Computer Science
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
ACM SIGACT News
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Hierarchical Nominal Terms and Their Theory of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
The lambda-context calculus (extended version)
Information and Computation
A formal calculus for informal equality with binding
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Capture-avoiding substitution as a nominal algebra
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Permissive-nominal logic: First-order logic over nominal terms and sets
ACM Transactions on Computational Logic (TOCL)
Taming non-compositionality using new binders
UC'07 Proceedings of the 6th international conference on Unconventional Computation
| Hi-index | 0.00 |
We study contexts (terms with holes) by proposing a 'λ-calculus with holes'. It is very expressive and can encode programming constructs apparently unrelated to contexts, including objects and algorithms in partial evaluation. We give proofs of confluence, preservation of strong normalisation, principal typing for an ML-style Hindley-Milner type system, and an applicative characterisation of contextual equivalence. We explore the limitations of the calculus including further applications, and discuss how they might be tackled.