Sciweavers

558 search results - page 55 / 112
» Compiling Resources in a Linear Logic Programming Language
Sort
View
WADT
1998
Springer
14 years 2 months ago
Non-deterministic Computations in ELAN
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
Hélène Kirchner, Pierre-Etienne More...
ENTCS
2008
142views more  ENTCS 2008»
13 years 10 months ago
Worst Case Reaction Time Analysis of Concurrent Reactive Programs
Reactive programs have to react continuously to their inputs. Here the time needed to react with the according output is important. While the synchrony hypothesis takes the view t...
Marian Boldt, Claus Traulsen, Reinhard von Hanxled...
HASKELL
2008
ACM
13 years 11 months ago
Lightweight monadic regions
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
Oleg Kiselyov, Chung-chieh Shan
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 10 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
APAL
2002
101views more  APAL 2002»
13 years 10 months ago
The logic of tasks
The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators and . This semantics understands formulas as tasks. An ...
Giorgi Japaridze