499 search results - page 63 / 100 » Logic Programming in a Fragment of Intuitionistic Linear Log... |
125
click to vote
FOSSACS
2009
Springer
15 years 11 months ago
2009
Springer
Standard analysis on recursive data structures restrict their attention to shape properties (for instance, a program that manipulates a list returns a list), excluding properties t...
116
click to vote
APAL
2005
15 years 4 months ago
2005
We prove a full completeness theorem for multiplicative-additive linear logic (i.e. MALL) using a double gluing construction applied to Ehrhard's -autonomous category of hype...
148
click to vote
FSTTCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We investigate streaming evaluation of filters on XML documents, evaluated both at the root node and at an arbitrary node. Motivated by applications in protocol processin...
134
click to vote
PEPM
2007
ACM
15 years 10 months ago
2007
ACM
The event-driven programming style is pervasive as an efficient method for interacting with the environment. Unfortunately, the event-driven style severely complicates program mai...
139
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...