Sciweavers

678 search results - page 81 / 136
» A simple typed intermediate language for object-oriented lan...
Sort
View
FOSSACS
2009
Springer
14 years 3 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
CACM
1998
81views more  CACM 1998»
13 years 8 months ago
Toward a Model of Type Inheritance
rigorous, and abstract— clearly defined and generally agreed—type inheritance model. To quote an article by Taivalsaari: “The basic idea of inheritance is quite simple ... [a...
C. J. Date, Hugh Darwen
ICNP
2005
IEEE
14 years 2 months ago
Typed Abstraction of Complex Network Compositions
straction of Complex Network Compositions∗ Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, and Ibrahim Matta Department of Computer Science Boston University The heterogeneity...
Azer Bestavros, Adam Bradley, Assaf J. Kfoury, Ibr...
PLANX
2007
13 years 10 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
ACL
2004
13 years 10 months ago
Balancing Clarity and Efficiency in Typed Feature Logic Through Delaying
The purpose of this paper is to re-examine the balance between clarity and efficiency in HPSG design, with particular reference to the design decisions made in the English Resourc...
Gerald Penn