Sciweavers

77 search results - page 2 / 16
» Declarative Scripting in Haskell
Sort
View
86
Voted
CORR
2008
Springer
142views Education» more  CORR 2008»
14 years 11 months ago
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
Paul Tarau
CORR
2008
Springer
158views Education» more  CORR 2008»
14 years 11 months ago
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
Paul Tarau
CIDR
2009
98views Algorithms» more  CIDR 2009»
15 years 22 days ago
From Declarative Languages to Declarative Processing in Computer Games
Recent work has shown that we can dramatically improve the performance of computer games and simulations through declarative processing: Character AI can be written in an imperati...
Ben Sowell, Alan J. Demers, Johannes Gehrke, Nitin...
ICFP
2007
ACM
15 years 11 months ago
Lazy call-by-value evaluation
Designing debugging tools for lazy functional programming languages is a complex task which is often solved by expensive tracing of lazy computations. We present a new approach in...
Bernd Braßel, Frank Huch, Germán Vida...
93
Voted
HASKELL
2006
ACM
15 years 5 months ago
RepLib: a library for derivable type classes
Some type class instances can be automatically derived from the structure of types. As a result, the Haskell language includes the “deriving” mechanism to automatic generates ...
Stephanie Weirich