Sciweavers

7529 search results - page 141 / 1506
» The Modula-3 Type System
Sort
View
LICS
2000
IEEE
15 years 10 months ago
Efficient and Flexible Matching of Recursive Types
Equality and subtyping of recursive types have been studied in the 1990s by Amadio and Cardelli; Kozen, Palsberg, and Schwartzbach; Brandt and Henglein; and others. Potential appl...
Jens Palsberg, Tian Zhao
FLOPS
2008
Springer
15 years 8 months ago
On-Demand Refinement of Dependent Types
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
Hiroshi Unno, Naoki Kobayashi
JSS
2002
63views more  JSS 2002»
15 years 6 months ago
Strategies for resolving inter-class data conflicts in mixed real-time database systems
Although many efficient concurrency control protocols have been proposed for real-time database systems, they are mainly designed for the systems with a single type of real-time t...
Kam-yiu Lam, Tei-Wei Kuo, Tony S. H. Lee
ACTA
2005
104views more  ACTA 2005»
15 years 6 months ago
Subtyping for session types in the pi calculus
Extending the pi calculus with the session types proposed by Honda et al. allows high-level specifications of structured patterns of communication, such as client-server protocols,...
Simon J. Gay, Malcolm Hole
LICS
2008
IEEE
16 years 23 days ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy