141 search results - page 3 / 29 » A Structural Induction Theorem for Processes |
TPHOL
2005
IEEE
14 years 1 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
CADE
2005
Springer
14 years 7 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
CADE
1994
Springer
13 years 11 months ago
1994
Springer
Pi is a system for the interactive construction and editing of formal derivations in the calculus of finitary partial inductive definitions. This calculus can be used as a logical ...
FMCAD
2007
Springer
14 years 1 months ago
2007
Springer
— Craig interpolants are often used to approximate inductive invariants of transition systems. Arithmetic relationships between numeric variables require word-level interpolants,...