169 search results - page 26 / 34 » A type system for well-founded recursion |
FSEN
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
AFP
2008
Springer
14 years 2 months ago
2008
Springer
Workflow systems are automated systems in which tasks are coordinated by assigning them to either humans or computers. Contemporary workflow systems are static and not very flex...
FUIN
2006
13 years 7 months ago
2006
In most models of computation, a device performs some type of process, and only some final output is regarded as the result. In adding an observer to such a device, one can obtain ...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
Mitchell's notion of representation independence is a particularly useful application of Reynolds' relational parametricity -- two different implementations of an abstra...
FOSSACS
2003
Springer
14 years 26 days ago
2003
Springer
Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe th...