Sciweavers

650 search results - page 16 / 130
» Logical Bisimulations and Functional Languages
Sort
View
ICFP
2005
ACM
14 years 6 months ago
A logical analysis of aliasing in imperative higher-order functions
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
Martin Berger, Kohei Honda, Nobuko Yoshida
DALT
2006
Springer
13 years 10 months ago
A Functional Program for Agents, Actions, and Deontic Specifications
We outline elements of the Abstract Contract Calculator, a prototype language implemented in Haskell (a declarative programming language) in which we simulate agents executing abst...
Adam Zachary Wyner
LPNMR
1990
Springer
13 years 10 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
APLAS
2003
ACM
13 years 12 months ago
Constraint Functional Logic Programming for Origami Construction
We describe origami programming methodology based on constraint functional logic programming. The basic operations of origami are reduced to solving systems of equations which desc...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi
LOPSTR
2005
Springer
14 years 7 days ago
Declarative Programming with Function Patterns
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
Sergio Antoy, Michael Hanus