Sciweavers

3583 search results - page 29 / 717
» A Type System for the Relational Calculus of Object Systems
Sort
View
FOSSACS
2001
Springer
14 years 1 months ago
High-Level Petri Nets as Type Theories in the Join Calculus
Abstract. We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four ...
Maria Grazia Buscemi, Vladimiro Sassone
RTA
2010
Springer
14 years 20 days ago
A Proof Calculus Which Reduces Syntactic Bureaucracy
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
Alessio Guglielmi, Tom Gundersen, Michel Parigot
CIE
2008
Springer
13 years 10 months ago
Principal Typings for Explicit Substitutions Calculi
Having principal typings (for short PT) is an important property of type systems. This property guarantees the possibility of type deduction which means it is possible to develop a...
Daniel Lima Ventura, Mauricio Ayala-Rincón,...
ICFP
1999
ACM
14 years 1 months ago
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract)
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Tur...
RTA
2010
Springer
13 years 7 months ago
The Undecidability of Type Related Problems in Type-free Style System F
We consider here a number of variations on the System F, that are predicative second-order systems whose terms are intermediate between the Curry style and Church style. The terms ...
Ken-etsu Fujita, Aleksy Schubert