20 search results - page 3 / 4 » Formalizing Undefinedness Arising in Calculus |
126
click to vote
APAL
2010
15 years 5 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
128
click to vote
SAS
2004
Springer
15 years 10 months ago
2004
Springer
Role logic is a notation for describing properties of relational structures in shape analysis, databases and knowledge bases. A natural fragment of role logic corresponds to two-va...
159
click to vote
DOCENG
2006
ACM
15 years 11 months ago
2006
ACM
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
149
click to vote
ICFP
2002
ACM
16 years 5 months ago
2002
ACM
Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of de...
127
click to vote
CONCUR
2005
Springer
15 years 10 months ago
2005
Springer
d Abstract) MohammadReza Mousavi1 , Murdoch J. Gabbay2 , and Michel A. Reniers1 1 Department of Computer Science, 2 Department of Computer Science, Eindhoven University of Technolo...