Sciweavers

254 search results - page 13 / 51
» Qualified Computations in Functional Logic Programming
Sort
View
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
13 years 9 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
13 years 11 months ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty
TLCA
2005
Springer
14 years 3 months ago
A Lambda Calculus for Quantum Computation with Classical Control
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the firs...
Peter Selinger, Benoît Valiron
ERLANG
2003
ACM
14 years 3 months ago
ARMISTICE: an experience developing management software with Erlang
In this paper, some experiences of using the concurrent functional language Erlang to implement a classical vertical application, a risk management information system, are present...
David Cabrero, Carlos Abalde, Carlos Varela, Laura...
CCS
2011
ACM
12 years 9 months ago
Automatically optimizing secure computation
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
Florian Kerschbaum