Sciweavers

103 search results - page 15 / 21
» Computational Interpretations of Classical Linear Logic
Sort
View
TLCA
2007
Springer
14 years 25 days ago
A Substructural Type System for Delimited Continuations
We propose type systems that abstractly interpret small-step rather than big-step operational semantics. We treat an expression or evaluation context as a structure in a linear log...
Oleg Kiselyov, Chung-chieh Shan
LICS
2005
IEEE
14 years 9 days ago
A Functional Quantum Programming Language
We introduce the language QML, a functional language for quantum computations on finite types. Its design is guided by its categorical semantics: QML programs are interpreted by ...
Thorsten Altenkirch, Jonathan Grattage
POPL
2012
ACM
12 years 2 months ago
Higher-order functional reactive programming in bounded space
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
Neelakantan R. Krishnaswami, Nick Benton, Jan Hoff...
ENTCS
2008
80views more  ENTCS 2008»
13 years 6 months ago
Idempotents in Dagger Categories: (Extended Abstract)
d abstract) Peter Selinger1 Department of Mathematics and Statistics Dalhousie University, Halifax, Nova Scotia, Canada Dagger compact closed categories were studied by Abramsky a...
Peter Selinger
TLCA
2009
Springer
14 years 1 months ago
A Logical Foundation for Environment Classifiers
Taha and Nielsen have developed a multi-stage calculus λα with a sound type system using the notion of environment classifiers. They are special identifiers, with which code fr...
Takeshi Tsukada, Atsushi Igarashi