Sciweavers

38 search results - page 3 / 8
» A completeness result for a realisability semantics for an i...
Sort
View
ENTCS
2000
59views more  ENTCS 2000»
13 years 5 months ago
Building continuous webbed models for system F
We present here a large family of concrete models for Girard and Reynolds polymorphism (System F), in a non categorical setting. The family generalizes the construction of the mod...
Stefano Berardi, Chantal Berline
GIS
2005
ACM
14 years 6 months ago
Dimension-refined topological predicates
Topological predicates, as derived from the 9-intersection model, have been widely recognized in GIS, spatial database systems, and many other geo-related disciplines. They are ba...
Mark McKenney, Alejandro Pauly, Reasey Praing, Mar...
FPCA
1989
13 years 9 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori
CSL
2004
Springer
13 years 11 months ago
Subtyping Union Types
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...
Jerome Vouillon
TGC
2005
Springer
13 years 11 months ago
A Distributed Object-Oriented Language with Session Types
Abstract. In the age of the world-wide web and mobile computing, programming communication-centric software is essential. Thus, programmers and program designers are exposed to new...
Mariangiola Dezani-Ciancaglini, Nobuko Yoshida, Al...