Sciweavers

4716 search results - page 362 / 944
» Tangible functional programming
Sort
View
LFP
1992
78views more  LFP 1992»
15 years 8 months ago
A Syntactic Approach to Fixed Point Computation on Finite Domains
We propose a syntactic approach to performing fixed point computation on finite domains. Finding fixed points in finite domains for monotonic functions is an essential task when c...
Tyng-Ruey Chuang, Benjamin Goldberg
CORR
2008
Springer
80views Education» more  CORR 2008»
15 years 6 months ago
A Dual Polynomial for OR
We reprove that the approximate degree of the OR function on n bits is ( n). We consider a linear program which is feasible if and only if there is an approximate polynomial for ...
Robert Spalek
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 6 months ago
Continuations, proofs and tests
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...
Stefano Guerrini, Andrea Masini
ECEASST
2006
92views more  ECEASST 2006»
15 years 6 months ago
An MDA Framework Supporting OCL
We present an mda framework, developed in the functional programming language sml, that tries to bridge the gap between formal software development and the needs of industrial soft...
Achim D. Brucker, Jürgen Doser, Burkhart Wolf...
ENTCS
2000
154views more  ENTCS 2000»
15 years 6 months ago
Debugging Haskell by Observing Intermediate Data Structures
Haskell has long needed a debugger. Although there has been much research into the topic of debugging lazy functional programs, no robust tool has yet come from the Haskell commun...
Andy Gill