Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Steffen van Bakel
2010 – today
- 2013
[j25]Steffen van Bakel, Stefano Berardi, Ulrich Berger: Preface. Ann. Pure Appl. Logic 164(6): 589-590 (2013)- [c22]Steffen van Bakel, Reuben N. S. Rowe: Functional Type Assignment for Featherweight Java - To Rinus Plasmeijer, in Honour of His 61st Birthday. The Beauty of Functional Code 2013: 27-46
- [i5]Steffen van Bakel, Franco Barbanera, Ugo de'Liguoro: Characterisation of Strongly Normalising lambda-mu-Terms. CoRR abs/1307.8202 (2013)
- 2012
- [j24]Steffen van Bakel: Completeness and Soundness Results for with Intersection and Union Types. Fundam. Inform. 121(1-4): 1-41 (2012)
- [c21]Steffen van Bakel, Maria Grazia Vigliotti: An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus - Extended Abstract. IFIP TCS 2012: 372-387
- 2011
- [j23]Steffen van Bakel: Strict intersection types for the Lambda Calculus. ACM Comput. Surv. 43(3): 20 (2011)
- [c20]Steffen van Bakel, Franco Barbanera, Ugo de'Liguoro: A Filter Model for the λμ-Calculus - (Extended Abstract). TLCA 2011: 213-228
- [c19]Reuben N. S. Rowe, Steffen van Bakel: Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming - (Extended Abstract). TLCA 2011: 229-244
- [i4]Steffen van Bakel: Reduction in X does not agree with Intersection and Union Types (Extended abstract). CoRR abs/1109.4570 (2011)
- [i3]Steffen van Bakel, Reuben N. S. Rowe: Semantic Predicate Types and Approximation for Class-based Object Oriented Programming. CoRR abs/1109.4618 (2011)
- [i2]Steffen van Bakel, Luca Cardelli, Maria Grazia Vigliotti: From X to Pi; Representing the Classical Sequent Calculus in the Pi-calculus. CoRR abs/1109.4817 (2011)
- [i1]Steffen van Bakel, Maria Grazia Vigliotti: Note on a simple type system for non-interference. CoRR abs/1109.4843 (2011)
- 2010
- [j22]Steffen van Bakel, Stefano Berardi, Ulrich Berger: Preface. Ann. Pure Appl. Logic 161(11): 1313-1314 (2010)
- [j21]Steffen van Bakel: Completeness and partial soundness results for intersection and union typing for lambda_µµ_. Ann. Pure Appl. Logic 161(11): 1400-1430 (2010)
- [c18]
- [e1]Steffen van Bakel, Stefano Berardi, Ulrich Berger (Eds.): Proceedings Third International Workshop on Classical Logic and Computation. EPTCS 47, 2010
2000 – 2009
- 2009
- [c17]Steffen van Bakel, Maria Grazia Vigliotti: A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types. CONCUR 2009: 84-98
- 2008
- [j20]
- [j19]Steffen van Bakel, Ikra Khan, Maria Grazia Vigliotti, John K. Heath: Modelling Intracellular Fate of FGF Receptors With BioAmbients. Electr. Notes Theor. Comput. Sci. 220(3): 181-197 (2008)
- [j18]Steffen van Bakel, Pierre Lescanne: Computation with classical sequents. Mathematical Structures in Computer Science 18(3): 555-609 (2008)
- [j17]Steffen van Bakel, Ugo de'Liguoro: Logical Equivalence for Subtyping Object and Recursive Types. Theory Comput. Syst. 42(3): 306-348 (2008)
- [j16]Steffen van Bakel: The heart of intersection type assignment: Normalisation proofs revisited. Theor. Comput. Sci. 398(1-3): 82-94 (2008)
- [c16]
- 2006
- [c15]Alexander J. Summers, Steffen van Bakel: Approaches to Polymorphism in Classical Sequent Calculus. ESOP 2006: 84-99
- 2005
- [j15]Steffen van Bakel, Jayshan Raghunandan: Implementing X. Electr. Notes Theor. Comput. Sci. 127(5): 171-195 (2005)
- [j14]Steffen van Bakel: Intersection and Union Types for chi. Electr. Notes Theor. Comput. Sci. 136: 203-227 (2005)
- [c14]Steffen van Bakel, Ugo de'Liguoro: Subtyping Object and Recursive Types Logically. ICTCS 2005: 66-80
- [c13]Steffen van Bakel, Stéphane Lengrand, Pierre Lescanne: The Language chi: Circuits, Computations and Classical Logic. ICTCS 2005: 81-96
- 2004
- [j13]Stéphane Lengrand, Pierre Lescanne, Daniel J. Dougherty, Mariangiola Dezani-Ciancaglini, Steffen van Bakel: Intersection types for explicit substitutions. Inf. Comput. 189(1): 17-42 (2004)
- [j12]Steffen van Bakel: Cut-Elimination in the Strict Intersection Type Assignment System is Strongly Normalizing. Notre Dame Journal of Formal Logic 45(1): 35-63 (2004)
- 2003
- [j11]Steffen van Bakel, Maribel Fernández: Normalization, approximation, and semantics for combinator systems. Theor. Comput. Sci. 290(1): 975-1019 (2003)
- [c12]Steffen van Bakel, Ugo de'Liguoro: Logical Semantics for the First Order varsigma-Calculus. ICTCS 2003: 202-215
- 2002
- [j10]Steffen van Bakel: Strongly Normalising Cut-Elimination with Strict Intersection Types. Electr. Notes Theor. Comput. Sci. 70(1): 19-36 (2002)
- [j9]
- [j8]Steffen van Bakel: Rank 2 Types for Term Graph Rewriting. Electr. Notes Theor. Comput. Sci. 75: 1-20 (2002)
- [j7]Steffen van Bakel, Franco Barbanera, Mariangiola Dezani-Ciancaglini, Fer-Jan de Vries: Intersection types for lambda-trees. Theor. Comput. Sci. 272(1-2): 3-40 (2002)
- [c11]Chiara Braghin, Agostino Cortesi, Riccardo Focardi, Steffen van Bakel: Boundary Inference for Enforcing Security Policies in Mobile Ambients. IFIP TCS 2002: 383-395
- [c10]Steffen van Bakel, Mariangiola Dezani-Ciancaglini: Characterising Strong Normalisation for Explicit Substitutions. LATIN 2002: 356-370
1990 – 1999
- 1999
- [c9]Steffen van Bakel, Franco Barbanera, Maribel Fernández: Polymorphic Intersection Type Assignment for Rewrite Systems with Abstractions and beta-Rule. TYPES 1999: 41-60
- 1997
- [j6]Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca, Pawel Urzyczyn: Comparing Cubes of Typed and Type Assignment Systems. Ann. Pure Appl. Logic 86(3): 267-303 (1997)
- [j5]Steffen van Bakel, Maribel Fernández: Normalization Results for Typeable Rewrite Systems. Inf. Comput. 133(2): 73-116 (1997)
- 1996
- [j4]Steffen van Bakel: Rank 2 Intersection Type Assignment in Term Rewriting Systems. Fundam. Inform. 26(2): 141-166 (1996)
- [c8]Steffen van Bakel, Franco Barbanera, Maribel Fernández: Rewrite Systems with Abstraction and beta-Rule: Types, Approximants and Normalization. ESOP 1996: 387-403
- 1995
- [j3]
- [c7]Steffen van Bakel, Maribel Fernández: Approximation and Normalization Results for Typeable Term Rewriting Systems. HOA 1995: 17-36
- [c6]Steffen van Bakel, Maribel Fernández: (Head-) Normalization of Typeable Rewrite Systems. RTA 1995: 279-293
- 1994
- [c5]Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca, Pawel Urzyczyn: Comparing Cubes. LFCS 1994: 353-365
- 1993
- [j2]Steffen van Bakel: Principal Type Schemes for the Strict Type Assignment System. J. Log. Comput. 3(6): 643-670 (1993)
- [c4]
- [c3]Steffen van Bakel, Maribel Fernández: Strong Normalization of Typeable Rewrite Systems. HOA 1993: 20-39
- [c2]Steffen van Bakel: Partial Intersection Type Assignment in Applicative Term Rewriting Systems. TLCA 1993: 29-44
- 1992
- [j1]Steffen van Bakel: Complete Restrictions of the Intersection Type Discipline. Theor. Comput. Sci. 102(1): 135-163 (1992)
- [c1]Steffen van Bakel, Sjaak Smetsers, Simon Brock: Partial Type Assignment in Left Linear Apllicative Term Rewriting Systems. CAAP 1992: 300-321
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 10:57 CEST by the dblp team