167
click to vote
TLCA
15 years 10 months ago
2007 Springer 
Abstract. In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent c...
141
click to vote
TLCA
15 years 10 months ago
2007 Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
132
click to vote
TLCA
15 years 10 months ago
2007 Springer
Abstract. This paper proposes two typing systems for session interactions in higherorder mobile processes. Session types for the HOπ-calculus capture high-level structures nicatio...
143
click to vote
TLCA
15 years 10 months ago
2007 Springer 
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
|
Theoretical Computer Science