198 search results - page 2 / 40 » A New Approach to Abstract Syntax Involving Binders |
UC
2007
Springer
13 years 11 months ago
2007
Springer
We propose an extension of the traditional λ-calculus in which terms are used to control an outside computing device (quantum computer, DNA computer...). We introduce two new bind...
FAC
2002
13 years 4 months ago
2002
proach to Abstract Syntax with Variable Binding1 Murdoch J. Gabbay and Andrew M. Pitts Cambridge University Computer Laboratory, Cambridge, UK
POPL
2012
ACM
12 years 19 days ago
2012
ACM
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract. We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is exactly the simply typed fragment of th...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...