Sciweavers

8 search results - page 1 / 2
» Step-Indexed Syntactic Logical Relations for Recursive and Q...
Sort
View
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
LICS
2009
IEEE
13 years 11 months ago
Logical Step-Indexed Logical Relations
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
Derek Dreyer, Amal Ahmed, Lars Birkedal
ENTCS
2007
82views more  ENTCS 2007»
13 years 4 months ago
Syntactic Logical Relations for Polymorphic and Recursive Types
The method of logical relations assigns a relational interpretation to types that expresses operational invariants satisfied by all terms of a type. The method is widely used in ...
Karl Crary, Robert Harper
ECOWS
2006
Springer
13 years 8 months ago
WSMO-MX: A Logic Programming Based Hybrid Service Matchmaker
In this paper, we present an approach to hybrid semantic web service matching based on both logic programming, and syntactic similarity measurement. The implemented matchmaker, ca...
Frank Kaufer, Matthias Klusch
CIE
2008
Springer
13 years 6 months ago
Recursion on Nested Datatypes in Dependent Type Theory
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
Ralph Matthes