239 search results - page 26 / 48 » The Safe Lambda Calculus |
71
Voted
APAL
2000
14 years 9 months ago
2000
It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a rami...
102
click to vote
ENTCS
2002
14 years 9 months ago
2002
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for ...
FOSSACS
2005
Springer
15 years 3 months ago
2005
Springer
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
LISP
2006
14 years 9 months ago
2006
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...
JSC
2000
14 years 9 months ago
2000
Tarski-Givant's map calculus is briefly reviewed, and a plan of research is outlined aimed at investigating applications of this ground equational formalism in the theorem-pr...