Sciweavers

63 search results - page 2 / 13
» On Completeness of Logical Relations for Monadic Types
Sort
View
JSYML
2008
74views more  JSYML 2008»
13 years 4 months ago
Omitting types for finite variable fragments and complete representations of algebras
. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
Tarek Sayed Ahmed, Hajnal Andréka, Istv&aac...
IANDC
2006
82views more  IANDC 2006»
13 years 4 months ago
Recognizability, hypergraph operations, and logical types
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which ...
Achim Blumensath, Bruno Courcelle
ESOP
2006
Springer
13 years 8 months ago
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
Amal J. Ahmed
ENTCS
2008
85views more  ENTCS 2008»
13 years 5 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
POPL
1993
ACM
13 years 9 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach