Sciweavers

18 search results - page 2 / 4
» Inductive Synthesis of Functional Programs: An Explanation B...
Sort
View
POPL
2007
ACM
14 years 5 months ago
Geometry of synthesis: a structured approach to VLSI design
We propose a new technique for hardware synthesis from higherorder functional languages with imperative features based on Reynolds's Syntactic Control of Interference. The re...
Dan R. Ghica
EH
1999
IEEE
351views Hardware» more  EH 1999»
13 years 9 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
PLPV
2009
ACM
14 years 1 months ago
Embedding a logical theory of constructions in Agda
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
Ana Bove, Peter Dybjer, Andrés Sicard-Ram&i...
ASPLOS
2006
ACM
13 years 11 months ago
Combinatorial sketching for finite programs
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...
Armando Solar-Lezama, Liviu Tancau, Rastislav Bod&...
GECCO
2008
Springer
201views Optimization» more  GECCO 2008»
13 years 6 months ago
Advanced techniques for the creation and propagation of modules in cartesian genetic programming
The choice of an appropriate hardware representation model is key to successful evolution of digital circuits. One of the most popular models is cartesian genetic programming, whi...
Paul Kaufmann, Marco Platzner