Sciweavers

439 search results - page 54 / 88
» Type invariants for Haskell
Sort
View
EUROCAST
2001
Springer
118views Hardware» more  EUROCAST 2001»
14 years 4 days ago
A Language Prototyping Tool Based on Semantic Building Blocks
We present a Language Prototyping System that facilitates the modular development of interpreters from semantic specifications. The theoretical basis of our system is the integrat...
José Emilio Labra Gayo, Juan Manuel Cueva L...
PPDP
2001
Springer
14 years 2 days ago
Cycle Therapy: A Prescription for Fold and Unfold on Regular Trees
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...
Franklyn A. Turbak, J. B. Wells
LISP
2008
105views more  LISP 2008»
13 years 7 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
SCP
2008
150views more  SCP 2008»
13 years 7 months ago
Google's MapReduce programming model - Revisited
Google's MapReduce programming model serves for processing large data sets in a massively parallel manner. We deliver the first rigorous description of the model including it...
Ralf Lämmel
JFP
2010
82views more  JFP 2010»
13 years 6 months ago
Formal polytypic programs and proofs
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic prog...
Wendy Verbruggen, Edsko de Vries, Arthur Hughes