Sciweavers

169 search results - page 22 / 34
» A type system for well-founded recursion
Sort
View
LICS
2009
IEEE
14 years 2 months ago
Logical Step-Indexed Logical Relations
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
Derek Dreyer, Amal Ahmed, Lars Birkedal
POPL
2005
ACM
14 years 8 months ago
Connecting effects and uniqueness with adoption
Abstract. In a previous paper, we discussed how the concepts of uniqueness and effects are interdependent. In this paper, we show how "Adoption and Focus," a proposal for...
John Tang Boyland, William Retert
POPL
2012
ACM
12 years 3 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...
MPC
2010
Springer
159views Mathematics» more  MPC 2010»
14 years 13 days ago
Subtyping, Declaratively
Abstract. It is natural to present subtyping for recursive types coinductively. However, Gapeyev, Levin and Pierce have noted that there is a problem with coinductive definitions ...
Nils Anders Danielsson, Thorsten Altenkirch
FPCA
1989
13 years 11 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori