Sciweavers

69 search results - page 2 / 14
» Explaining Algebraic Theory with Functional Programs
Sort
View
ENTCS
2007
104views more  ENTCS 2007»
13 years 7 months ago
An Algebra of Pure Quantum Programming
We develop a sound and complete equational theory for the functional quantum programming language QML. The soundness and completeness of the theory are with respect to the previou...
Thorsten Altenkirch, Jonathan Grattage, Juliana Ka...
ICFP
2006
ACM
14 years 7 months ago
Algebraic fusion of functions with an accumulating parameter and its improvement
We present a unifying solution to the problem of fusion of functions, where both the producer function and the consumer function have one accumulating parameter. The key idea in t...
Shin-ya Katsumata, Susumu Nishimura
MPC
2004
Springer
155views Mathematics» more  MPC 2004»
14 years 25 days ago
Inferring Type Isomorphisms Generically
Abstract. Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary prod...
Frank Atanassow, Johan Jeuring
ICFP
2006
ACM
14 years 7 months ago
Context-parametric polykinded types
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...
Pablo Nogueira
POPL
2008
ACM
14 years 7 months ago
Foundations for structured programming with GADTs
GADTs are at the cutting edge of functional programming and become more widely used every day. Nevertheless, the semantic foundations underlying GADTs are not well understood. In ...
Patricia Johann, Neil Ghani