1458 search results - page 108 / 292 » Monads for incremental computing |
124
click to vote
ICFP
2004
ACM
16 years 3 months ago
2004
ACM
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...
143
Voted
TPHOL
2008
IEEE
15 years 9 months ago
2008
IEEE
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
144
Voted
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
144
click to vote
PLDI
2006
ACM
15 years 9 months ago
2006
ACM
We propose the monadic linear logic programming language LolliMon as a new foundation for the specification of distributed trust management systems, particularly the RT framework...
119
click to vote
LICS
2005
IEEE
15 years 9 months ago
2005
IEEE
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...