102 search results - page 19 / 21 » Syntactic Logical Relations for Polymorphic and Recursive Ty... |
APAL
2008
13 years 7 months ago
2008
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Grishin ([10]) proposed enriching the Lambek calculus with multiplicative disjunction (par) and coresiduals. Applications to linguistics were discussed by Moortgat ([15]), who spok...
AI
2010
Springer
13 years 7 months ago
2010
Springer
We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of `lightweight' description...
CICLING
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Semantic inference is an important component in many natural language understanding applications. Classical approaches to semantic inference rely on logical representatio...