Sciweavers

558 search results - page 86 / 112
» Compiling Resources in a Linear Logic Programming Language
Sort
View
HASKELL
2006
ACM
14 years 1 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
COLING
1996
13 years 9 months ago
Reversible delayed lexical choice in a bidirectional framework
We describe a bidirectional framework for natural language parsing and generation, using a typedfeatureformalismand an HPSG-based grammar with a parser and generator derived from ...
Graham Wilcock, Yuji Matsumoto
SFM
2005
Springer
243views Formal Methods» more  SFM 2005»
14 years 1 months ago
Hermes: Agent-Based Middleware for Mobile Computing
Hermes is a middleware system for design and execution of activity-based applications in distributed environments. It supports mobile computation as an application implementation s...
Flavio Corradini, Emanuela Merelli
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
14 years 8 months ago
Polymorphic Fractional Capabilities
Abstract. The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed...
Hirotoshi Yasuoka, Tachio Terauchi
IFL
2005
Springer
116views Formal Methods» more  IFL 2005»
14 years 1 months ago
Proof Tool Support for Explicit Strictness
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Marko C. J. D. van Eekelen, Maarten de Mol