Sciweavers

248 search results - page 19 / 50
» Phantom types and subtyping
Sort
View
MPC
2010
Springer
159views Mathematics» more  MPC 2010»
14 years 11 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
SCP
2010
155views more  SCP 2010»
13 years 6 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
ICDE
1995
IEEE
99views Database» more  ICDE 1995»
14 years 9 months ago
Record Subtyping in Flexible Relations by Means of Attribute Dependencies
The model of flexible relations supports heterogeneous sets of tuples in a strongly typed way. The elegance of the standard relational model is preserved by using a single, generi...
Christian Kalus, Peter Dadam
IFL
2001
Springer
14 years 1 days ago
Runtime Behavior of Conversion Interpretation of Subtyping
A programming language with subtyping can be translated into a language without subtyping by inserting conversion functions. Previous studies of this interpretation showed only the...
Yasuhiko Minamide
PADL
2004
Springer
14 years 29 days ago
Typing XHTML Web Applications in ML
Abstract. In this paper, we present a type system for typing Web applications in SMLserver, an efficient multi-threaded Web server platform for Standard ML scriptlets. The type sys...
Martin Elsman, Ken Friis Larsen