Sciweavers

237 search results - page 5 / 48
» Coercions in a polymorphic type system
Sort
View
TACS
1994
Springer
13 years 11 months ago
ML Typing, Explicit Polymorphism and Qualified Types
The ML type system was originally introduced as a means of identifying a class of terms in a simple untyped language, often referred to as core-ML, whose evaluation could be guaran...
Mark P. Jones
TIC
1998
Springer
13 years 11 months ago
Polymorphic Equality - No Tags Required
Polymorphic equality is a controversial language construct. While being convenient for the programmer, it has been argued that polymorphic equality (1) invites to violation of soft...
Martin Elsman
CORR
2010
Springer
84views Education» more  CORR 2010»
13 years 5 months ago
Termination Casts: A Flexible Approach to Termination with General Recursion
This paper proposes a type-and-effect system called Teq, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd...
Aaron Stump, Vilhelm Sjöberg, Stephanie Weiri...
MPC
2004
Springer
123views Mathematics» more  MPC 2004»
14 years 27 days ago
Constructing Polymorphic Programs with Quotient Types
The efficient representation and manipulation of data is one of the fundamental tasks in the construction of large software systems. Parametric polymorphism has been one of the mo...
Michael Abbott, Thorsten Altenkirch, Neil Ghani, C...
TLCA
1997
Springer
13 years 11 months ago
Coinductive Axiomatization of Recursive Type Equality and Subtyping
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
Michael Brandt, Fritz Henglein