Sciweavers

678 search results - page 10 / 136
» Dependent Types for Program Understanding
Sort
View
CORR
2011
Springer
173views Education» more  CORR 2011»
13 years 3 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
ICFP
2010
ACM
13 years 9 months ago
Parametricity and dependent types
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
Jean-Philippe Bernardy, Patrik Jansson, Ross Pater...
ESOP
2004
Springer
14 years 2 months ago
A Dependently Typed Ambient Calculus
The Ambient calculus is a successful model of distributed, mobile computation, and has been the vehicle of new ideas for resource access control. Mobility types have been used to e...
Cédric Lhoussaine, Vladimiro Sassone
ICSE
1992
IEEE-ACM
14 years 26 days ago
The Use of Program Dependence Graphs in Software Engineering
This paper describes a language-independent program representation--the program dependence graph--and discusses how program dependence graphs, together with operations such as pro...
Susan Horwitz, Thomas W. Reps
PLDI
1998
ACM
14 years 1 months ago
Eliminating Array Bound Checking Through Dependent Types
We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This ...
Hongwei Xi, Frank Pfenning