Sciweavers

424 search results - page 22 / 85
» A Lambda Calculus with Forms
Sort
View
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 7 months ago
Liberalizing Dependency
Abstract. The dependency core calculus (DCC), a simple extension of the computational lambda calculus, captures a common notion of dependency that arises in many programming langua...
Avik Chaudhuri
PLDI
2009
ACM
14 years 2 months ago
Typed self-representation
Self-representation – the ability to represent programs in their own language – has important applications in reflective languages and many other domains of programming langu...
Tillmann Rendel, Klaus Ostermann, Christian Hofer
LFP
1990
171views more  LFP 1990»
13 years 8 months ago
Operational and Axiomatic Semantics of PCF
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms ...
Brian T. Howard, John C. Mitchell
RTA
2001
Springer
13 years 12 months ago
Matching Power
In this paper we give a simple and uniform presentation of the rewriting calculus, also called Rho Calculus. In addition to its simplicity, this formulation explicitly allows us to...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
ICFP
2003
ACM
14 years 7 months ago
Dynamic rebinding for marshalling and update, with destruct-time?
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Gavin M. Bierman, Michael W. Hicks, Peter Sewell, ...