Sciweavers

4757 search results - page 26 / 952
» Monads for Functional Programming
Sort
View
CSL
2004
Springer
14 years 1 months ago
Complete Lax Logical Relations for Cryptographic Lambda-Calculi
Abstract. Security properties are profitably expressed using notions of contextual equivalence, and logical relations are a powerful proof technique to establish contextual equiva...
Jean Goubault-Larrecq, Slawomir Lasota, David Nowa...
CSL
2007
Springer
13 years 11 months ago
MSO on the Infinite Binary Tree: Choice and Order
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
Arnaud Carayol, Christof Löding
ENTCS
2006
124views more  ENTCS 2006»
13 years 7 months ago
Generic Trace Theory
Trace semantics has been defined for various non-deterministic systems with different input/output types, or with different types of "non-determinism" such as classical ...
Ichiro Hasuo, Bart Jacobs, Ana Sokolova
ICFP
2006
ACM
14 years 7 months ago
Modelling deterministic concurrent I/O
The problem of expressing I/O and side effects in functional languages is a well-established one. This paper addresses this problem from a general semantic viewpoint by giving a u...
Malcolm Dowse, Andrew Butterfield
LMO
2000
13 years 9 months ago
A Metamodel for Concurrent, Object-based Programming
The development of flexible and reusable concurrent object-oriented programming ions has suffered from the inherent problem that reusability and extensibility is limited due to pos...
Jean-Guy Schneider, Markus Lumpe