Previous TCS seminars

• 2012 04 02
  Paula Severi (University of Leicester, UK)
  Alpha conversion for infinitary lambda-calculus
• 2012 03 28
  Terese Afternoon in Aachen
• 2012 03 23
  NVTI Theory Day in Vredenburg, Utrecht
• 2012 02 24
  Patrick Bahr (University of Copenhagen)
  Infinitary term graph rewriting
  
• 2012 02 17
  Aart Middeldorp (University of Innsbruck, Austria)
  Ordinals and Knuth-Bendix Orders
• 2012 01 25
  SAFE-NL workshop
• 2011 12 16
  Michel Dekking (TU Delft)
• 2011 12 09
  Terese Afternoon in Utrecht
• 2011 12 02
  30 years of computer science, Rode Hoed
  
• 2011 11 18
  Enno Folkerts
  Invertibility and Unsolvabilty in the pure Lambda-Calculus
  
• 2011 10 28
  TCSA Day at UvA
• 2011 09 30
  Simona Ronchi della Rocca (University of Torino)
  Types for complexity-bounded computations
• 2011 09 23
  Wan Fokkink (VU)
  Why Modal Characterizations of Process Semantics Totally Rock
• 2011 09 16
  Ronald de Wolf (CWI and UvA)
  Grover's quantum search algorithm, with applications
• 2011 06 30
  Merijn Verstraaten (VU)
  presentation literature study dependently typed programming
• 2011 06 17
  Terese Meeting in Eindhoven
• 2011 05 27
  Helle Hvid Hansen (TU/e)
  Pointwise extensions of GSOS-defined operations, from bitstreams to Mealy machines
• 2011 05 20
  Cynthia Kop (VU)
  Higher Order Dependency Pairs for Algebraic Functional Systems
  
• 2011 04 15
  Wil Dekkers (RU)
  Weak mu-equality is decidable
• 2011 04 08
  Symposium Logic and Culture in Hoog Brabant, Utrecht
• 2011 03 25
  Andrew Polonsky (VU)
  The failure of the range property for the lambda theory H (part II)
• 2011 03 18
  Andrew Polonsky (VU)
  The failure of the range property for the lambda theory H (part I)
• 2011 03 11
  Giulio Manzonetto (RU)
  The Resource Lambda Calculus
• 2011 03 04
  NVTI Theory Day in Utrecht
  
• 2011 02 25
  Frits Dannenberg (TUD)
  On Toeplitz Substitutions and Transducer Equivalence
• 2011 02 18
  Carlos Lombardi (Universities of Buenos Aires and Quilmes)
  Economical normalising strategies for non sequential higher order calculi
• 2011 02 11
  Jaco van de Pol (University of Twente)
  LTSmin for symbolic, distributed and multi-core verification
• 2011 01 28
  Thibaut Balabonski (PPS Paris Diderot, France)
  A causal approach to efficient rewriting
• 2011 01 21
  Ronald de Wolf (CWI)
  Quantum proofs for classical theorems
• 2010 12 10
  Giulio Manzonetto (RU)
  A calculus of coercions proving the strong normalization of MLF
• 2010 11 26
  Alexander Belov (CWI and University of Latvia)
  Poset of infinite words under a relation of transforming by a Mealy machine: some algebraic properties
• 2010 11 19
  Nicola Bonzanni (VU)
  A dynamic regulatory network model reveals hard-wired heterogeneity in blood stem cells
• 2010 11 18
  TeReSe Afternoon at VU
  
• 2010 11 12
  Jeroen Ketema
  Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and Lambda-Calculus
• 2010 11 05
  Iris Loeb (VU)
  On Tarski's Foundations of the Geometry of Solids
• 2010 10 29
  TCSA dag Theoretical Computer Science Amsterdam) op het CWI
• 2010 10 15
  David M Williams
  Formal Analysis of Buyer-Seller Watermarking Protocols
• 2010 07 09
  Martijn Vermaat (VU)
  Infinitary rewriting in Coq
• 2010 07 02
  Cynthia Kop (VU)
  Dynamic higher-order dependency pairs
  Atze van der Ploeg (VU)
  titel
• 2010 06 25
  Stefan Vijzelaar (VU)
  A Shared Disk on Distributed Storage
• 2010 06 18
  Cynthia Kop (VU)
  Transformations of higher-order term rewrite systems
• 2010 06 11
  Dimitri Hendriks (VU)
  Modular Construction of Fixed Point Combinators and Clocked Boehm Trees
• 2010 06 04
  Ela Krepska (VU)
  Proving stabilization of biological systems
• 2010 06 02
  Juergen Giesl (RWTH Aachen, Germany)
  Automated Termination Analysis of Java Bytecode by Term Rewriting
• 2010 05 28
  TeReSe afternoon in Aachen
• 2010 05 21
  Kees Verstoep (VU)
  Efficient Large-Scale Model Checking
• 2010 05 07
  Hans Zantema (TU/e, RU)
  Streams: automatically proving well-definedness, productivity and equality
• 2010 04 16
  Bas Luttik (TU/e, VU)
  Interactive Turing Machines
• 2010 04 09
  Aart Middeldorp (University of Innsbruck, Austria)
  Polynomial Interpretations Revisited
• 2010 03 19
  Ariya Isihara (VU)
  Algorithmic term rewriting systems
• 2010 03 05
  Atze van der Ploeg (VU, UU)
  Efficiently compiling lazy functional languages
• 2010 02 26
  Wan Fokkink (VU)
  An Introduction to Undecidability
• 2010 02 05
  Stefan Vijzelaar (VU)
  A Virtual Shared Disk on Distributed Redundant Storage
• 2010 01 29
  Wieger Wesselink (TU/e)
  Higher-order rewriting in the mCRL2 toolset
• 2010 01 15
  Wan Fokkink (VU)
  Introduction to quantum computing
• 2009 12 11
  Aart Middeldorp (University of Innsbruck)
  Decreasing Diagrams and Relative Termination
• 2009 12 15
  Symposium: The End of Infinity
• 2009 11 19
  TeReSe Afternoon
  Utrecht University
• 2009 11 13
  Fatemeh Ghassemi (Sharif University and VU)
  Equational Reasoning on Ad Hoc Networks
• 2009 10 30
  Theoretical Computer Science Amsterdam Day (TCSA Day)
• 2009 10 23
  Maciej Gazda (VU)
  Modal Logic and the Approximation Induction Principle
• 2009 10 16
  Carlos Lombardi (Universities of Buenos Aires and Quilmes)
  Proof terms for infinitary term rewriting
• 2009 10 08
  Rena Bakhshi (VU)
  Mean-field analysis for the evaluation of gossip protocols
• 2009 10 02
  Deepak Kapur (University of New Mexico, USA)
  Rewriting with Semantic Data Structures: Termination Using Dependency Pairs
• Joerg Endrullis and Roel de Vrijer and Johannes Waldmann
  Local Termination
• 2009 06 26
  Despo Galataki
  Design and Analysis of UniPro Protocols
• 2009 06 19
  Joerg Endrullis and Dimitri Hendrik (VU)
  From Outermost to Context-Sensitive Rewriting
• 2009 06 05
  Jeroen Ketema (UT)
  Comparing Boehm-like trees
• 2009 05 29
  Doaitse Swierstra (UU)
  Typed Transformations of Typed Abstract Syntax
• 2009 05 08
  Giulio Manzonetto (INRIA, France)
  Models and theories of lambda calculus
• 2009 04 03
  Alban Ponse (UvA)
  Proposition Algebra with Projective Limits
• 2009 03 27
  Rinus Plasmeijer (RU)
  iTasks: a Combinator Library to Specify Interactive Workflow Systems for the Web
• 2009 03 20
  NVTI Theory Day 2009
  Utrecht
• 2009 03 13
  Martijn Vermaat (VU)
  Names and numbers in binding
• 2009 03 06
  Piet Rodenburg (UvA)
  Typability in partial groupoids
• 2008 12 15
  Ana Opresecu (VU)
  FTRepMI: Fault-tolerant, Sequentially-consistent Object Replication for Grid Applications
• 2008 12 12
  Maciej Gazda (VU)
  Equalities between process terms in various equivalences
  Daniela Gavidia (VU)
  An Analytical Model of Information Dissemination for a Gossip-based Protocol
• 2008 11 21
  Ela Krepska (VU)
  Executing multi-cellular development: Modelling C.elegans Vulva with Petri Nets
• 2008 11 14
  Cynthia Kop (VU)
  A higher-order iterative path ordering
  Clemens Grabmayer (UU)
  Data-oblivious stream productivity
• Steffen van Bakel (Imperial College, UK)
  Classical Logic and Computation: term rewriting, CBV and CBN, pi- calculus, lambda mu, semantics ...
• 2008 09 22
  Johannes Waldmann (HTWK Leipzig)
  The Leipzig "autotool" E-Learning/E-Testing system for student problems in Theoretical Computer Science
• 2008 09 19
  Felienne Hermans (TU/e)
  Proving SN-infinity automatically
• 2008 08 28
  Jeroen Prins (VU)
  Confluence in infinitary term rewriting systems
• 2008 08 22
  Zurab Khasidashvili (Intel Israel)
  On compositional equivalence verification of hardware
• 2008 06 24
  Terese Day at the VU
• 2008 06 20
  Paul van Tilburg (TUE)
  A Context-Free Process as a Pushdown Automaton
• 2008 06 06
  Sebastian Stern (VU)
  The Thue-Morse Sequence
• 2008 05 09
  Jeroen Ketema (Tohoku University, Japan)
  On Normalisation of Infinitary Combinatory Reduction Systems
  
• 2008 04 25
  Krzysztof Apt (CWI)
  Order independence of strategy elimination procedures in strategic games
• 2008 04 18
  Rena Bakhshi (VU)
  Probabilistic finite-state leader election algorithm in anonymous rings
• 2008 04 04
  Vincent van Oostrom (UU)
  Preservation of strong normalisation
• 2008 03 28
  Marek Kwiatkowski (Edinburgh)
  The continuous pi-calculus
• 2008 03 20
  Yaroslav D. Sergeyev (University of Calabria, Italy)
  The infinity computer
• 2008 03 07
  Adam Koprowski (TU/e)
  The color project and arctic termination
• 2008 02 22
  Nicola Bonzanni (VU)
  Modelling symport/antiport P-systems with a class of hierarchical Petri Nets
• 2008 02 15
  Jeroen Prins (VU)
  Proving easiness using confining classes
• 2008 02 01
  Roel de Vrijer (VU)
  An application of Barendregt's Lemma (part 3)
• 2008 01 28
  Erik de Vink (TU/e)
  Analysis of aa-tRNA competition with prism
  
• 2008 01 25
  Roel de Vrijer (VU)
  Barendregt's Lemma (part 2) (part 2)
• 2008 01 18
  Roel de Vrijer (VU)
  Strong Normalization of Labelled Lambda Reduction (part 1)
• 2007 10 12
  Wan Fokkink (VU)
  Ready to preorder: get your BCCSP axiomatization for free!
• 2007 10 01
  Kristoffer Rose (IBM Research)
  crsx.sf.net: Combinatory Reduction Systems with Extensions in Java
• 2007 06 15
  Maxim Hendriks (VU, RU)
  Teaching logic using a state-of-the-art proof assistant
• 2007 06 08
  Andreas Weiermann (Ghent University)
  Some new results concerning the Ackermann function
• 2007 03 30
  Helle Hvid Hansen (VU)
  Bisimulation for neighbourhood models (2)
• 2007 03 23
  Helle Hvid Hansen (VU)
  Bisimulation for neighbourhood models (1)
• 2007 03 16
  Cynthia Maasbommel (VU)
  A formal analysis of the RIES electronic voting protocol
• 2007 03 02
  Detlef Plump (University of York, UK)
  GP: Language and Environment
• 2007 02 23
  Rana Bakhshi (VU) Formal analysis of tree-based aggregation protocols
• 2007 01 17
  Annelies Gerber (Univerity of Rouen)
  Mathematical Models for Propositional Proof Systems and Complexity
• 2006 12 15
  Marek Kwiatkowski (University of Edinburgh, Scotland)
  Process calculi and molecular biology
• 2006 12 01
  Yaroslav Usenko (TU/e)
  4 case studies with mCRL2 in 2006
• 2006 11 17
  Herman Geuvers (RU)
  (In)consistent extensions of higher order logic
• 2006 10 20
  Ariya Isihara(VU)
  Veblen Hierarchy with Tree Ordinals
• 2006 09 29
  Cezary Kaliszyk (RU)
  Web Interface for Proof Assistants
• 2006 09 22
  Jaco van de Pol (CWI)
  Identities on Fixpoint Equation Systems
• 2006 09 15
  Christian Urban (TU Munich)
  How to Define Functions by Structural Recursion over Alpha-Equivalence Classes
• 2006 09 08
  Aad Mathijssen (TUE)
  One-and-a-halfth-order logic
• 2006 09 04
  Tomasz Blanc (INRIA, Paris)
  Independence and non-interference in the lambda-calculus
• 2006 07 14
  Joerg Endrullis (VU)
  Matrix Interpretations for Proving Termination of Term Rewriting
• 2006 06 22
  Terese Day at VU
• 2006 06 16
  Jaap Weel (VU)
  
• 2006 05 19
  Sander Bruggink (UU)
• 2006 05 12
  Francois Mbgong (VU)
• 2006 02 24
  Bas Luttik (TUE)
  Towards a finite equational base for CCS
• 2006 02 17
  Ariya Isihara (VU)
  ETTO: equational transfinite term operating
• 2006 02 10
  Andreas Weiermann (UU)
  Some interesting properties of the Ackermann function
• 2005 12 16
  Nachum Dershowitz
  The four sons of Penrose
• 2005 12 12
  Murdoch Gabbay (TU Eindhoven)
  Nominal Logic and FM techniques: reasoning about binding without pain
• 2005 12 09
  Iris Loeb and Herman Geuvers (RU)
  Natural deduction via graphs
• 2005 10 21
  Jan Terlouw (RUG)
  Proving confluence by commuting functions instead of relations
• 2005 09 30
  Martijn Monteban (VU)
  Equivalence relations and reduction algorithms on linear process equations
• 2005 09 23
  Dimitri Hendriks (RU)
  The Thue-Morse sequence in Coq
• 2005 09 09
  Jan Friso Groote (TUE)
  visualisation of large state graphs
• 2005 07 01
  Sara van Langenhove (University of Ghent)
  Towards an Optimal Slicing of Hierarchical Automata
  Geert Vernaeve (University of Ghent)
  A calculus for partially defined iota terms
• 2005 06 03
  Juerg Endrullis (University of Leibniz)
  Deleting and Match-Bounded String Rewriting
  
• 2005 05 27
  Adam Koprowski (TUE)
  Proving Liveness with Fairness using Rewriting
• 2005 05 20
  Wan Fokkink (VU and CWI) Is Timed Branching Bisimilarity an Equivalence Indeed?
• 2005 04 29
  Jan Willem Klop, VU
  bag is not a context-free process
• 2005 04 22
  Bahare Badban, CWI
  Verifying a Sliding Window Protocol with Piggybacking in muCRL
• 2005 04 01
  Jeroen Ketema, VU
  Infinitary combinatory reduction systems
• 2005 03 23
  Fritz Henglein, DIKU, Copenhagen
  Generic Multiset Discrimination for Acyclic Data
• 2005 03 18
  Anton Wijs, CWI
  From timed Chi to mCRL: Combining Performance and Functional Analysis
• 2005 03 11
  Roel de Vrijer, VU
  unique normal forms for infinite rewriting
• 2005 02 04
  Jan Willem Klop, VU
  varia
• 2005 01 14
  Hans van Maaren, Delft University
  Sums of squares, satisfiability and maximum satisfiability
• 2004 12 17
  Wan Fokkink (VU and CWI)
  On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds
• 2004 12 10
  Clemens Grabmayer (VU) r> Huettel/Stirling: ``Actions Speak Louder than Words - Proving Bisimilarity for Context-Free Processes'' (II)
• 2004 12 03
  Roel de Vrijer, VU
  Infinitary Normalization
• 2004 11 26
  Clemens Grabmayer (VU)
  Huettel/Stirling: ``Actions Speak Louder than Words - Proving Bisimilarity for Context-Free Processes'' (I)
• 2004 11 19
  Freek Wiedijk (RU and VU)
  Convertibility Proof Terms
• 2004 11 12
  Wan Fokkink (VU and CWI)
  Project of International Allure - Self-Managing Global Computer
• 2004 10 22
  Jan Willem Klop, VU, RU, and CWI
  Staircase to Syracuse - an intractable termination problem
• 2004 10 15
  Helle Hvid Hansen, VU and CWI
  A Coalgebraic Perspective on Monotone Modal Logic
• 2004 01 15
  Helle Hvid Hansen, VU and CWI
  A Coalgebraic Perspective on Monotone Modal Logic
• 2004 09 10
  Jan Willem Klop, VU, CWI and KUN
  Proving Equations for Cyclic Objects (II)
• 2004 09 10
  Jan Willem Klop, VU, CWI and KUN
  Proving Equations for Cyclic Objects (I)
• 2004 07 02
  Jan Willem Klop, VU and KUN
  Heroes of applied logic
• 2004 05 28
  Jeroen Ketema, VU
  Boehm-like trees for term rewriting systems
• 2004 05 07
  Jeroen Ketema, VU
  Some undecidable approximations of term rewriting systems
• 2004 04 16
  Marc Bezem, University of Bergen, Norway
  A depth-first implementation of geometric logic in Prolog
  
• 2004 03 19
  Femke van Raamsdonk, VU
  Erasing reductions
• 2004 02 20
  Roel de Vrijer
  Second-order logic
• 2004 02 13
  Jan Willem Klop
  Reduction cycles
• 2004 01 30
  Roel de Vrijer, VU
  Second-order logic
• 2004 01 23
  Clemens Grabmayer, VU
  Transforming proofs by coinduction into `traditional' proofs
• 2003 11 28
  Ralf Laemmel, VU and CWI
  Evolution of Rule-Based Systems
• 2003 11 21
  no seminar
• 2003 11 14
  Jan Rutten, CWI and VU
  A coinductive calculus of automata, regular expressions, and formal languages
• 2003 11 07
  Stefan Blom, CWI and TUE
  ordered infinitary lambda calculus
• 2003 10 31
  no seminar
• 2003 10 24
  autumn break
• 2003 10 17
  autumn break
• 2003 10 10
  Hans Zantema, TUE
  TORPA: Termination Of Rewriting Proved Automatically
• 2003 10 03
  Jan Rutten, CWI and VU
  A case study in coinductive stream calculus: signal flow graphs
• 2003 09 26
  Wan Fokkink, CWI and VU
  Verifying a Sliding Window Protocol in mCRL
• 2003 09 19
  Wan Fokkink, CWI and VU
  Verifying a Sliding Window Protocol in mCRL
• 2003 07 4
  Nicole de Kleijn, VU
  Well-foundedness of RPO in Coq
  and
  Zena Ariola, University of Oregon, USA
  Minimal Classical Logic and Control Operators
• 2003 06 27
  Nicole de Kleijn, VU
  Well-foundedness of RPO in Coq
• 2003 06 20
  Hitoshi Ohsaki, AIST, Japan
  Petri nets, term rewriting and tree automata
• 2003 06 13
  Ralf Laemmel, VU
  Generic tree traversal strategies
• 2003 05 23
  Paulien de Wind, VU
  Compositionality of Hennessy-Milner logic through structural operational semantics
• 2003 05 16
  Paulien de Wind, VU
  Compositionality of Hennessy-Milner logic through structural operational semantics
• 2003 05 09
  Nicole de Kleijn, VU
  Well-foundedness of the multiset ordering
• 2003 05 02
  Martin Caminada, VU
  
• 2003 04 25
  
• 2003 04 18
  no seminar
• 2003 04 11
  Bas Luttik, VU
  Remarks on Thatte's Transformation for Term Rewriting Systems
• 2003 04 04
  Femke van Raamsdonk, VU
  quantum computing intro
• 2003 03 21
  Femke van Raamsdonk, VU
  quantum computing intro
• 2003 03 14
  Vincent van Oostrom, UU
  lambdascope: an other optimal implementation of lambda calculus
• 2003 02 21
  no seminar
• 2003 02 14
  Mark vd Brand, CWI and VU Amsterdam
  The ASF+SDF Compiler: Efficient compilation of a term rewriting based formalism
• 2003 02 07
  Clemens Grabmayer, VU Amsterdam
  What are derivable and admissible rules (in natural deduction proof systems)?
• 2003 01 31
  Mark vd Brand, CWI and VU Amsterdam
  The ASF+SDF Compiler: Efficient compilation of a term rewriting based formalism
• 2003 01 24
  Clemens Grabmayer, VU Amsterdam
  What are derivable and admissible rules (in natural deduction proof systems)?
• 2002 12 20
  Jan Rutten, CWI and VU
  A coinductive calculus of component connectors
• 2002 12 13
  Jan Rutten, CWI and VU
  A coinductive calculus of component connectors
• 2002 12 06
  Rob van Glabbeek, Stanford University USA
  Proof nets for unit-free multiplicative-additive linear logic
  (joint work with Dominic Hughes)
• 2002 11 29
  Femke van Raamsdonk, VU Amsterdam
  Some linear logic
• 2002 11 22
  Femke van Raamsdonk, VU Amsterdam
  Some linear logic
• 2002 11 15
  Bas Luttik, VU Amsterdam
  Unique decomposition theorem for certain partially ordered monoids
• 2002 11 08
  Bas Luttik, VU Amsterdam
  Unique decomposition theorem for certain partially ordered monoids
• 2002 11 01
  Bas Luttik, VU Amsterdam
  Unique decomposition theorem for certain partially ordered monoids
• 2002 10 25
  no seminar
• 2002 10 18
  no seminar
• 2002 10 11
  no seminar
• 2002 10 04
  Jean-Pierre Jouannaud, LRI and LIX, Paris, France.
  Termination orderings for polymorphic higher-order rewriting "a la Nipkow".
• 2002 09 27
  Clemens Grabmayer, VU Amsterdam
  A Duality in Proof Systems for Recursive Type Equality and for Bisimulation Equivalence on Cyclic Term Graphs
• 2002 09 20
  Jeroen Ketema, VU Amsterdam
  Berry's sequentiality theorem
• 2002 09 13
  Jeroen Ketema, VU Amsterdam
  Berry's sequentiality theorem
• 2002 09 06
  Femke van Raamsdonk, VU Amsterdam
  Higher-order matching
• gap
• 2002 03 22
  Maarten Marx, ILLC, UvA Amsterdam
  Hybrid Logic and the Semantic Web
• 2002 03 15
  Mirna Bognar, VU Amsterdam
  The lambda cube with contexts
• 2002 03 08
  Mirna Bognar, VU Amsterdam
  The lambda cube with contexts
• 2002 02 22
  Vincent van Oostrom, UU, Utrecht
  Lambda Calculus with an End-of-Scope Operator
• 2002 02 15
  Jan Willem Klop, KUN, Nijmegen, VU, CWI, Amsterdam
  Iterative Path Orders
• 2002 02 01
  Juan Heguiabehere, ILLC, UvA, Amsterdam
  The Random Modal QBF Test Set
• 2002 01 25
  Wan Fokkink, CWI, VU, Amsterdam
  From modularities to congruence formats
• 2002 01 18
  Mihály Petreczky, VU Amsterdam
  DNA computing at a glance (an overview of results in DNA computing)
• 2002 01 11
  Balder ten Cate, ILLC, UvA
  Epistemic Actions
• 2001 12 14
  Mihály Petreczky, VU Amsterdam
  DNA computing at a glance (an overview of results in DNA computing)
• 2001 11 30
  Vince Bárány, VU Amsterdam
  State Space Transformation - A Specification Language and a Program Generator
• 2001 11 23
  Vince Bárány, VU Amsterdam
  State Space Transformation - A Specification Language and a Program Generator
• 2001 11 16
  Dragan Bošnacki, TUE Eindhoven
  A Heuristics for Symmetry Reduction for Model Checking
• 2001 11 09
  Bas Luttik, VU
  Choice Quantification in Process Algebra
• 2001 11 02
  Bas Luttik, VU
  Choice Quantification in Process Algebra
• 2001 10 19
  Thierry Joly, Catholic University Nijmegen
  A Proof of Normalization and its Operational Content
• 2001 10 12
  Aart Middeldorp, University of Tsukuba
  Approximating Dependency Graphs using Tree Automata Techniques
• 2001 10 05
  Martijn Oostdijk, Catholic University Nijmegen
  Interactive mathematical documents
• 2001 09 21
  Clemens Grabmayer, VU
  A Duality between Derivations and Consistency-Unfoldings in two different known Proof-System for Recursive Type Equality
• 2001 09 14
  Clemens Grabmayer, VU
  A Duality between Derivations and Consistency-Unfoldings in two different known Proof-System for Recursive Type Equality
• 2001 07 06
  Georgi Jojgov, Technical University Eindhoven
  Systems for open terms: an overview
• 2001 06 08
  Femke van Raamsdonk, VU
  Higher-order recursive path ordering
• 2001 05 29
  Femke van Raamsdonk, VU
  Higher-order recursive path ordering
• 2001 05 15
  Nachum Dershowitz, Tel Aviv University
  Abstract canonical proof systems
• 2001 05 11
  Femke van Raamsdonk, VU
  Higher-order recursive path ordering
• 2001 05 01
  Paula Severi, Universidad de la Republica Oriental del Uruguay
  Infinitary lambda calculus and discrimination of Boehm trees