22 search results - page 4 / 5 » The Rewriting Calculus as a Combinatory Reduction System |
IFIP
2004
Springer
14 years 27 days ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
FLOPS
2008
Springer
13 years 9 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
LFP
1990
13 years 8 months ago
1990
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 ...