Sciweavers

22 search results - page 3 / 5
» A PolyTime Functional Language from Light Linear Logic
Sort
View
NJC
2000
169views more  NJC 2000»
13 years 5 months ago
A Type System for Bounded Space and Functional In-Place Update
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
Martin Hofmann
BPM
2009
Springer
153views Business» more  BPM 2009»
13 years 6 months ago
DECLARE Demo: A Constraint-based Workflow Management System
Abstract. Mainstream workflow management systems are using procedural languages ranging from BPMN and EPCs to BPEL and YAWL. By demonstrating DECLARE, we will show that it is also ...
Maja Pesic, Helen Schonenberg, Wil M. P. van der A...
POPL
2010
ACM
14 years 3 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
ICFP
2008
ACM
14 years 5 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
ICFP
2007
ACM
14 years 5 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson