Sciweavers

CORR
2011
Springer
173views Education» more  CORR 2011»
12 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
FUIN
2010
103views more  FUIN 2010»
13 years 2 months ago
Automation for Dependently Typed Functional Programming
Abstract. Writing dependently typed functional programs that capture non-trivial program properties, such as those involving membership, ordering and non-linear arithmetic, is diff...
Sean Wilson, Jacques D. Fleuriot, Alan Smaill
ICFP
2010
ACM
13 years 5 months ago
Scrapping your inefficient engine: using partial evaluation to improve domain-specific language implementation
Partial evaluation aims to improve the efficiency of a program by specialising it with respect to some known inputs. In this paper, we show that partial evaluation can be an effec...
Edwin Brady, Kevin Hammond
FLOPS
2008
Springer
13 years 6 months ago
On-Demand Refinement of Dependent Types
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
Hiroshi Unno, Naoki Kobayashi
CSL
2000
Springer
13 years 9 months ago
Subtyping with Power Types
This paper introduces a typed λ-calculus called λPower , a predicative reformulation of part of Cardelli’s power type system. Power types integrate subtyping into the typing t...
David Aspinall
IFL
2005
Springer
207views Formal Methods» more  IFL 2005»
13 years 10 months ago
A Dependently Typed Framework for Static Analysis of Program Execution Costs
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
Edwin Brady, Kevin Hammond
FROCOS
2005
Springer
13 years 10 months ago
ATS: A Language That Combines Programming with Theorem Proving
ATS is a language with a highly expressive type system that supports a restricted form of dependent types in which programs are not allowed to appear in type expressions. The langu...
Sa Cui, Kevin Donnelly, Hongwei Xi
TACAS
2007
Springer
108views Algorithms» more  TACAS 2007»
13 years 11 months ago
State of the Union: Type Inference Via Craig Interpolation
The ad-hoc use of unions to encode disjoint sum types in C programs and the inability of C’s type system to check the safe use of these unions is a long standing source of subtle...
Ranjit Jhala, Rupak Majumdar, Ru-Gang Xu
OOPSLA
2007
Springer
13 years 11 months ago
Dependent classes
Dependent Classes Vaidas Gasiunas and Mira Mezini Technische Universit¨at Darmstadt, Germany Abstract. Dependent classes are parameterized classes, the interface and implementatio...
Vaidas Gasiunas, Mira Mezini, Klaus Ostermann
PLPV
2010
ACM
14 years 1 months ago
Singleton types here, singleton types there, singleton types everywhere
Singleton types are often considered a poor man’s substitute for dependent types. But their generalization in the form of GADTs has found quite a following. The main advantage o...
Stefan Monnier, David Haguenauer