Sciweavers

1932 search results - page 250 / 387
» A Functional Quantum Programming Language
Sort
View
133
Voted
BIRTHDAY
2006
Springer
15 years 8 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
ASIAN
1998
Springer
105views Algorithms» more  ASIAN 1998»
15 years 8 months ago
Two Flavors of Offline Partial Evaluation
Abstract. Type-directed partial evaluation is a new approach to program specialization for functional programming languages. Its merits with respect to the traditional offline part...
Simon Helsen, Peter Thiemann
TCSB
2010
15 years 3 months ago
Modelling Self-assembly in BlenX
Abstract. The process through which disordered components spontaneously arrange themselves into patterns is called self-assembly. Molecular self-assembly describes the process by w...
Roberto Larcher, Corrado Priami, Alessandro Romane...
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 11 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi
143
Voted
LCTRTS
2009
Springer
15 years 11 months ago
Eliminating the call stack to save RAM
Most programming languages support a call stack in the programming model and also in the runtime system. We show that for applications targeting low-power embedded microcontroller...
Xuejun Yang, Nathan Cooprider, John Regehr