200 search results - page 11 / 40 » The Intensional Lambda Calculus |
FCT
2005
Springer
14 years 3 months ago
2005
Springer
We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during the reduction. The terms form wide class which inc...
FROCOS
2005
Springer
14 years 3 months ago
2005
Springer
Reasoning about the correctness of program transformations requires a notion of program equivalence. We present an observational semantics for the concurrent lambda calculus with f...
LOGCOM
2010
13 years 8 months ago
2010
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...
POPL
1999
ACM
14 years 2 months ago
1999
ACM
Notions of program dependency arise in many settings: security, partial evaluation, program slicing, and call-tracking. We argue that there is a central notion of dependency commo...
ENTCS
2006
13 years 9 months ago
2006
We present a proof technique in -calculus that can facilitate inductive reasoning on -terms by separating certain -developments from other -reductions. We give proofs based on thi...