Sciweavers

175 search results - page 3 / 35
» A Complete and Recursive Feature Theory
Sort
View
POPL
2010
ACM
14 years 3 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
EXTREME
2004
ACM
13 years 11 months ago
A Simple Proof for the Turing-Completeness of XSLT and XQuery
The World Wide Web Consortium recommends both XSLT and XQuery as query languages for XML documents. XSLT, originally designed to transform XML into XSL-FO, is nowadays a fully gro...
Stephan Kepser
CALCO
2005
Springer
119views Mathematics» more  CALCO 2005»
13 years 11 months ago
The Category Theoretic Solution of Recursive Program Schemes
This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoret...
Stefan Milius, Lawrence S. Moss
ICFP
2004
ACM
14 years 5 months ago
A sound (and complete) model of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
Matthias Blume, David A. McAllester
ESOP
2006
Springer
13 years 9 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