Sciweavers

54 search results - page 10 / 11
» Inductive Synthesis of Recursive Functional Programs
Sort
View
BIRTHDAY
2006
Springer
13 years 11 months ago
Eliminating Dependent Pattern Matching
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
Healfdene Goguen, Conor McBride, James McKinna
CADE
2010
Springer
13 years 8 months ago
Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
Brigitte Pientka, Joshua Dunfield
SCP
2011
255views Communications» more  SCP 2011»
13 years 2 months ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes
VLSID
2007
IEEE
231views VLSI» more  VLSID 2007»
14 years 8 months ago
AHIR: A Hardware Intermediate Representation for Hardware Generation from High-level Programs
We present AHIR, an intermediate representation (IR), that acts as a transition layer between software compilation and hardware synthesis. Such a transition layer is intended to t...
Sameer D. Sahasrabuddhe, Hakim Raja, Kavi Arya, Ma...
CSL
2007
Springer
14 years 1 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
Arnold Beckmann