2500 search results - page 390 / 500 » Logical Semantics of Modularisation |
128
click to vote
WWW
2008
ACM
16 years 3 months ago
2008
ACM
We propose a method of classifying XML documents and extracting XML schema from XML by inductive inference based on constraint logic programming. The goal of this work is to type ...
131
click to vote
CADE
2006
Springer
16 years 3 months ago
2006
Springer
Propositional canonical Gentzen-type systems, introduced in [1], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
122
click to vote
ICFP
2008
ACM
16 years 2 months ago
2008
ACM
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
119
click to vote
ICFP
2002
ACM
16 years 2 months ago
2002
ACM
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
122
click to vote
POPL
2010
ACM
16 years 9 days ago
2010
ACM
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...