424 search results - page 36 / 85 » A Lambda Calculus with Forms |
FAC
2002
13 years 7 months ago
2002
Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. More...
ENTCS
2002
13 years 7 months ago
2002
The refinement calculus is a well-established theory for translating specifications to program code. Recent research has extended the calculus to handle real-time requirements and...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...