Steffen van Bakel

Orcid: 0000-0003-2077-011X

According to our database1, Steffen van Bakel authored at least 61 papers between 1992 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Adding Negation to Lambda Mu.
Log. Methods Comput. Sci., 2023

A Calculus of Delayed Reductions.
Proceedings of the International Symposium on Principles and Practice of Declarative Programming, 2023

2019
Exception Handling and Classical Logic.
Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages, 2019

2018
Characterisation of Normalisation Properties for λμ using Strict Negated Intersection Types.
ACM Trans. Comput. Log., 2018

Intersection Types for the lambda-mu Calculus.
Log. Methods Comput. Sci., 2018

2017
Orchestrated session compliance.
J. Log. Algebraic Methods Program., 2017

2016
Characterisation of Approximation and (Head) Normalisation for λμ using Strict Intersection Types.
Proceedings of the Proceedings Eighth Workshop on Intersection Types and Related Systems, 2016

2014
Semantic Types and Approximation for Featherweight Java.
Theor. Comput. Sci., 2014

A fully-abstract semantics of lambda-mu in the pi-calculus.
Proceedings of the Proceedings Fifth International Workshop on Classical Logic and Computation, 2014

2013
Functional Type Assignment for Featherweight Java - To Rinus Plasmeijer, in Honour of His 61st Birthday.
Proceedings of the Beauty of Functional Code, 2013

2012
Completeness and Soundness Results for with Intersection and Union Types.
Fundam. Informaticae, 2012

Characterisation of Strongly Normalising lambda-mu-Terms.
Proceedings of the Proceedings Sixth Workshop on Intersection Types and Related Systems, 2012

An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus - Extended Abstract.
Proceedings of the Theoretical Computer Science, 2012

2011
Strict intersection types for the Lambda Calculus.
ACM Comput. Surv., 2011

Note on a simple type system for non-interference
CoRR, 2011

From X to Pi; Representing the Classical Sequent Calculus in the Pi-calculus
CoRR, 2011

Reduction in X does not agree with Intersection and Union Types (Extended abstract)
CoRR, 2011

Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming - (Extended Abstract).
Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011

A Filter Model for the <i>λμ</i>-Calculus - (Extended Abstract).
Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011

2010
Sound and Complete Typing for lambda-mu
Proceedings of the Proceedings Fifth Workshop on Intersection Types and Related Systems, 2010

Preface.
Ann. Pure Appl. Log., 2010

Completeness and partial soundness results for intersection and union typing for lambda<sup>_</sup>µµ<sup>_</sup>.
Ann. Pure Appl. Log., 2010

2009
Semantic predicate types and approximation for class-based object oriented programming.
Proceedings of the 11th International Workshop on Formal Techniques for Java-like Programs, 2009

A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
The heart of intersection type assignment: Normalisation proofs revisited.
Theor. Comput. Sci., 2008

Logical Equivalence for Subtyping Object and Recursive Types.
Theory Comput. Syst., 2008

Computation with classical sequents.
Math. Struct. Comput. Sci., 2008

Modelling Intracellular Fate of FGF Receptors With BioAmbients.
Proceedings of the Sixth Workshop on Quantitative Aspects of Programming Languages, 2008

Preface.
Ann. Pure Appl. Log., 2008

Subject Reduction vs Intersection.
Proceedings of the Visions of Computer Science, 2008

2006
Approaches to Polymorphism in Classical Sequent Calculus.
Proceedings of the Programming Languages and Systems, 2006

2005
Subtyping Object and Recursive Types Logically.
Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

The Language chi: Circuits, Computations and Classical Logic.
Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2004
Cut-Elimination in the Strict Intersection Type Assignment System is Strongly Normalizing.
Notre Dame J. Formal Log., 2004

Intersection types for explicit substitutions.
Inf. Comput., 2004

Implementing X.
Proceedings of the 2nd International Workshop on Term Graph Rewriting, 2004

Intersection and Union Types for chi.
Proceedings of the Third International Workshop on Intersection Types and Related Systems, 2004

2003
Normalization, approximation, and semantics for combinator systems.
Theor. Comput. Sci., 2003

Logical Semantics for the First Order varsigma-Calculus.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

2002
Intersection types for lambda-trees.
Theor. Comput. Sci., 2002

Preface.
Proceedings of the Intersection Types and Related Systems, 2002

Strongly Normalising Cut-Elimination with Strict Intersection Types.
Proceedings of the Intersection Types and Related Systems, 2002

Rank 2 Types for Term Graph Rewriting.
Proceedings of the International Workshop in Types in Programming, 2002

Characterising Strong Normalisation for Explicit Substitutions.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Boundary Inference for Enforcing Security Policies in Mobile Ambients.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

1999
Polymorphic Intersection Type Assignment for Rewrite Systems with Abstractions and <i>beta</i>-Rule.
Proceedings of the Types for Proofs and Programs, 1999

1997
Normalization Results for Typeable Rewrite Systems.
Inf. Comput., 1997

Comparing Cubes of Typed and Type Assignment Systems.
Ann. Pure Appl. Log., 1997

1996
Rank 2 Intersection Type Assignment in Term Rewriting Systems.
Fundam. Informaticae, 1996

Rewrite Systems with Abstraction and beta-Rule: Types, Approximants and Normalization.
Proceedings of the Programming Languages and Systems, 1996

1995
Intersection Type Assignment Systems.
Theor. Comput. Sci., 1995

Normalization Properties of Typeable Term Rewriting Systems (Abstract).
Proceedings of the 9th International Workshop on Unification, 1995

(Head-) Normalization of Typeable Rewrite Systems.
Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

Approximation and Normalization Results for Typeable Term Rewriting Systems.
Proceedings of the Higher-Order Algebra, 1995

1994
Comparing Cubes.
Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

1993
Principal Type Schemes for the Strict Type Assignment System.
J. Log. Comput., 1993

Partial Intersection Type Assignment in Applicative Term Rewriting Systems.
Proceedings of the Typed Lambda Calculi and Applications, 1993

Strong Normalization of Typeable Rewrite Systems.
Proceedings of the Higher-Order Algebra, 1993

Essential Intersection Type Assignment.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

1992
Complete Restrictions of the Intersection Type Discipline.
Theor. Comput. Sci., 1992

Partial Type Assignment in Left Linear Apllicative Term Rewriting Systems.
Proceedings of the CAAP '92, 1992


  Loading...