Sciweavers

53 search results - page 5 / 11
» Partial Evaluation for the Lambda Calculus
Sort
View
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 7 months ago
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
Patrick Baillot, Marco Pedicini
POPL
2008
ACM
14 years 7 months ago
A logical account of pspace
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
APAL
2010
129views more  APAL 2010»
13 years 7 months ago
Kripke models for classical logic
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the meaning of the new notion and its a...
Danko Ilik, Gyesik Lee, Hugo Herbelin
LISP
2006
77views more  LISP 2006»
13 years 7 months ago
Expressing combinatory reduction systems derivations in the rewriting calculus
The last few years have seen the development of the rewriting calculus (also called rho-calculus or -calculus) that uniformly integrates first-order term rewriting and the -calculu...
Clara Bertolissi, Horatiu Cirstea, Claude Kirchner
ICDE
1996
IEEE
103views Database» more  ICDE 1996»
14 years 8 months ago
Using Partial Differencing for Efficient Monitoring of Deferred Complex Rule Conditions
This paper presents a difference calculus for determining changes to rule conditions in an active DBMS. The calculus has been used for implementing an algorithm to efficiently mon...
Martin Sköld, Tore Risch