Sciweavers

20 search results - page 3 / 4
» Formalizing Undefinedness Arising in Calculus
Sort
View
APAL
2010
98views more  APAL 2010»
13 years 10 months ago
Classical proof forestry
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...
Willem Heijltjes
SAS
2004
Springer
14 years 3 months ago
Generalized Records and Spatial Conjunction in Role Logic
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...
Viktor Kuncak, Martin C. Rinard
DOCENG
2006
ACM
14 years 3 months ago
Comparing XML path expressions
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 ...
Pierre Genevès, Nabil Layaïda
ICFP
2002
ACM
14 years 9 months ago
Tagless staged interpreters for typed languages
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...
Emir Pasalic, Walid Taha, Tim Sheard
CONCUR
2005
Springer
14 years 3 months ago
SOS for Higher Order Processes
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...
Mohammad Reza Mousavi, Murdoch Gabbay, Michel A. R...