16 search results - page 2 / 4 » tlca 2007 |
157
click to vote
TLCA
2007
Springer
15 years 11 months ago
2007
Springer
We propose type systems that abstractly interpret small-step rather than big-step operational semantics. We treat an expression or evaluation context as a structure in a linear log...
140
click to vote
TLCA
2007
Springer
15 years 11 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...
146
Voted
TLCA
2007
Springer
15 years 11 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...
167
Voted
TLCA
2007
Springer
15 years 11 months ago
2007
Springer
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
137
Voted
TLCA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...