Sciweavers

188 search results - page 3 / 38
» The Implicit Calculus of Constructions as a Programming Lang...
Sort
View
CONCUR
2000
Springer
13 years 9 months ago
An Implicitly-Typed Deadlock-Free Process Calculus
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
Naoki Kobayashi, Shin Saito, Eijiro Sumii
ICFP
2010
ACM
13 years 6 months ago
Parametricity and dependent types
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
Jean-Philippe Bernardy, Patrik Jansson, Ross Pater...
ECOOP
2000
Springer
13 years 9 months ago
A Basic Model of Typed Components
This paper studies specific language level abstractions for component-based programming. We propose a simple model which captures some basic ingredients — like explicit context ...
João Costa Seco, Luís Caires
ESOP
2004
Springer
13 years 10 months ago
A Dependently Typed Ambient Calculus
The Ambient calculus is a successful model of distributed, mobile computation, and has been the vehicle of new ideas for resource access control. Mobility types have been used to e...
Cédric Lhoussaine, Vladimiro Sassone
IJCAI
1993
13 years 6 months ago
A Language for Implementing Arbitrary Logics
SEQUEL is a new-generation functional programming language, which allows the specification of types in a notation based on the sequent calculus. The sequent calculus notation suff...
Mark Tarver