Sciweavers

564 search results - page 1 / 113
» Dependent types and program equivalence
Sort
View
POPL
2010
ACM
14 years 1 months ago
Dependent types and program equivalence
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
Jianzhou Zhao, Limin Jia, Stephanie Weirich, Vilhe...
BIRTHDAY
2006
Springer
13 years 7 months ago
Eliminating Dependent Pattern Matching
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
Healfdene Goguen, Conor McBride, James McKinna
FP
1991
95views Formal Methods» more  FP 1991»
13 years 7 months ago
Making Functionality More General
The notion of functionality is not cast in stone, but depends upon what we have as types in our language. With partial equivalence relations (pers) as types we show that the funct...
Graham Hutton, Ed Voermans
POS
1990
Springer
13 years 7 months ago
Type Equivalence Checking in Persistent Object Systems
Richard C. H. Connor, Alfred L. Brown, Quintin I. ...
IFIP
2004
Springer
13 years 9 months ago
Dynamic Typing with Dependent Types
Dependent type systems are promising tools programmers can use to increase the reliability and security of their programs. Unfortunately, dependently-typed programming languages re...
Xinming Ou, Gang Tan, Yitzhak Mandelbaum, David Wa...