Sciweavers

30 search results - page 6 / 6
» Types and higher-order recursion schemes for verification of...
Sort
View
LFP
1992
140views more  LFP 1992»
13 years 6 months ago
Global Tagging Optimization by Type Inference
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
Fritz Henglein
AFP
2008
Springer
249views Formal Methods» more  AFP 2008»
13 years 11 months ago
An iTask Case Study: A Conference Management System
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...
Rinus Plasmeijer, Peter Achten, Pieter W. M. Koopm...
CIE
2008
Springer
13 years 7 months ago
Recursion on Nested Datatypes in Dependent Type Theory
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
Ralph Matthes
OOPSLA
2005
Springer
13 years 10 months ago
Fine-grained interoperability through mirrors and contracts
As a value flows across the boundary between interoperating languages, it must be checked and converted to fit the types and representations of the target language. For simple f...
Kathryn E. Gray, Robert Bruce Findler, Matthew Fla...
ICFP
2007
ACM
13 years 9 months ago
iTasks: executable specifications of interactive work flow systems for the web
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are au...
Rinus Plasmeijer, Peter Achten, Pieter W. M. Koopm...