Sciweavers

4757 search results - page 387 / 952
» Monads for Functional Programming
Sort
View
SFP
2003
15 years 8 months ago
FSM-Hume is finite state
Abstract Hume is a domain-specific programming language targeting resourcebounded computations. It is based on generalised concurrent bounded automata, controlled by transitions c...
Greg Michaelson, Kevin Hammond, Jocelyn Sér...
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 6 months ago
Realizing evaluation strategies by hierarchical graph rewriting
We discuss the realization of evaluation strategies for the concurrent constraint-based functional language ccfl within the translation schemata when compiling ccfl programs into t...
Petra Hofstedt
JAR
2008
101views more  JAR 2008»
15 years 6 months ago
Tilting at Windmills with Coq: Formal Verification of a Compilation Algorithm for Parallel Moves
This article describes the formal verification of a compilation algorithm that transforms parallel moves (parallel assignments between variables) into a semanticallyequivalent sequ...
Laurence Rideau, Bernard P. Serpette, Xavier Leroy
MSCS
2008
87views more  MSCS 2008»
15 years 6 months ago
Coercions in a polymorphic type system
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The tra...
Zhaohui Luo
ENTCS
2000
83views more  ENTCS 2000»
15 years 6 months ago
Typed Logical Variables in Haskell
We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey [16]. To...
Koen Claessen, Peter Ljunglöf