Sciweavers

1131 search results - page 124 / 227
» Logic Programming, Functional Programming, and Inductive Def...
Sort
View
97
Voted
CORR
2008
Springer
142views Education» more  CORR 2008»
15 years 21 days 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
POPL
2008
ACM
16 years 28 days ago
Automatic inference of stationary fields: a generalization of java's final fields
Java programmers can document that the relationship between two objects is unchanging by declaring the field that encodes that relationship to be final. This information can be us...
Christopher Unkel, Monica S. Lam
88
Voted
DBPL
1991
Springer
76views Database» more  DBPL 1991»
15 years 4 months ago
A Functional DBPL Revealing High Level Optimizations
We present a functional DBPL in the style of FP that facilitates the definition of precise semantics and opens up opportunities for far-reaching optimizations. The language is int...
Martin Erwig, Udo W. Lipeck
103
Voted
TACAS
2009
Springer
128views Algorithms» more  TACAS 2009»
15 years 7 months ago
All-Termination(T)
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
Panagiotis Manolios, Aaron Turon
CORR
2004
Springer
97views Education» more  CORR 2004»
15 years 14 days ago
Quantum typing
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda-calculus for the QRAM model, following the work of P. Seling...
Benoît Valiron