Steffen van Bakel
Steffen van Bakel
Verified email at - Homepage
Cited by
Cited by
Complete restrictions of the intersection type discipline
S van Bakel
Theoretical Computer Science 102 (1), 135-163, 1992
Intersection type assignment systems
S van Bakel
Theoretical Computer Science 151 (2), 385-435, 1995
Intersection type disciplines in lambda calculus and applicative term rewriting systems
SJ van Bakel
Mathematisch Centrum, 1993
Intersection types for explicit substitutions
S Lengrand, P Lescanne, D Dougherty, M Dezani-Ciancaglini, ...
Information and Computation 189 (1), 17-42, 2004
The Language χ: Circuits, Computations and Classical Logic
S van Bakel, S Lengrand, P Lescanne
Theoretical Computer Science, 81-96, 2005
Principal type schemes for the strict type assignment system
S van Bakel
Journal of Logic and Computation 3 (6), 643-670, 1993
Normalization results for typeable rewrite systems
S van Bakel, M Fernández
Information and Computation 133 (2), 73-116, 1997
Strict intersection types for the lambda calculus
SV Bakel
ACM Computing Surveys (CSUR) 43 (3), 1-49, 2011
Computation with classical sequents
S van Bakel, P Lescanne
Mathematical Structures in Computer Science 18 (3), 555-609, 2008
Comparing cubes of typed and type assignment systems
S van Bakel, L Liquori, S Ronchi Della Rocca, P Urzyczyn
Annals of Pure and Applied Logic 86 (3), 267-303, 1997
Cut-Elimination in the strict intersection type assignment system is strongly normalizing
S van Bakel
Notre Dame journal of Formal Logic 45 (1), 35-63, 2004
From X to Pi; Representing the Classical Sequent Calculus in the Pi-calculus
S Van Bakel, L Cardelli, MG Vigliotti
arXiv preprint arXiv:1109.4817, 2011
Completeness and partial soundness results for intersection and union typing for λ¯ μμ̃
S Van Bakel
Annals of Pure and Applied Logic 161 (11), 1400-1430, 2010
Rank 2 intersection type assignment in term rewriting systems
S van Bakel
Fundamenta Informaticae 26 (2), 141-166, 1996
Normalization, approximation, and semantics for combinator systems
S van Bakel, M Fernández
Theoretical Computer Science 290 (1), 975-1019, 2003
A logical interpretation of the λ-calculus into the π-calculus, preserving spine reduction and types
S van Bakel, MG Vigliotti
International Conference on Concurrency Theory, 84-98, 2009
A Filter Model for the λμ-Calculus
S Van Bakel, F Barbanera, U de’Liguoro
International Conference on Typed Lambda Calculi and Applications, 213-228, 2011
Sound and complete typing for lambda-mu
S Van Bakel
arXiv preprint arXiv:1101.4425, 2011
Boundary inference for enforcing security policies in mobile ambients
C Braghin, A Cortesi, R Focardi, S van Bakel
Proceedings of the IFIP 17th World Computer Congress-TC1 Stream/2nd IFIP …, 2002
Strong normalization of typeable rewrite systems
S van Bakel, M Fernández
Higher-Order Algebra, Logic, and Term Rewriting, 20-39, 1994
The system can't perform the operation now. Try again later.
Articles 1–20