42 search results - page 7 / 9 » Normal Form Theorem Proving for the Lambek Calculus |
IGPL
2007
13 years 5 months ago
2007
This work studies the structure of proofs containing non-analytic cuts in the cut-based system, a sequent inference system in which the cut rule is not eliminable and the only bra...
MCMASTER
1993
13 years 9 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
CSL
2000
Springer
13 years 10 months ago
2000
Springer
This paper introduces a typed λ-calculus called λPower , a predicative reformulation of part of Cardelli’s power type system. Power types integrate subtyping into the typing t...
ACL2
2006
ACM
13 years 11 months ago
2006
ACM
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
BIRTHDAY
2006
Springer
13 years 9 months ago
2006
Springer
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...