Sciweavers

125 search results - page 4 / 25
» A bisimulation for type abstraction and recursion
Sort
View
JLP
2007
74views more  JLP 2007»
13 years 8 months ago
Linearity and bisimulation
Exploiting linear type structure, we introduce a new theory bisimilarity for the π-calculus in which we abstract away not only τ-actions but also non-τ actions which do not aff...
Nobuko Yoshida, Kohei Honda, Martin Berger
CIE
2008
Springer
13 years 10 months ago
Recursion on Nested Datatypes in Dependent Type Theory
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
Ralph Matthes
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
14 years 1 months ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...
TLCA
1993
Springer
14 years 18 days ago
Recursive Types Are not Conservative over F
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...
Giorgio Ghelli
POPL
2009
ACM
14 years 9 months ago
Types and higher-order recursion schemes for verification of higher-order programs
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
Naoki Kobayashi