Sciweavers

351 search results - page 6 / 71
» Nominal Equational Logic
Sort
View
ENTCS
2008
85views more  ENTCS 2008»
13 years 7 months ago
Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking
In the book on Advanced Topics in Types and Programming Languages, Crary illustrates the reasoning technique of logical relations in a case study about equivalence checking. He pr...
Julien Narboux, Christian Urban
CADE
2006
Springer
14 years 7 months ago
A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL
The nominal datatype package implements an infrastructure in Isabelle/HOL for defining languages involving binders and for reasoning conveniently about alpha-equivalence classes. P...
Christian Urban, Stefan Berghofer
CADE
2005
Springer
14 years 7 months ago
Nominal Techniques in Isabelle/HOL
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...
Christian Urban, Christine Tasson
ICALP
2001
Springer
13 years 12 months ago
An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
Furio Honsell, Marino Miculan, Ivan Scagnetto
DLOG
2003
13 years 9 months ago
Reasoning about Nominals with FaCT and RACER
We present a translation of looping alternating two-way automata into a comparably inexpressive description logic, which is contained in SHIQ. This enables us to perform the empti...
Jan Hladik