Fer-Jan de Vries

Log. Methods Comput. Sci., 2021

2018

Many-valued logics inside λ-calculus: Church's rescue of Russell with B{\"}ohm trees.

[BibT_eX]

[DOI]

CoRR, 2018

2017

The infinitary lambda calculus of the infinite eta Böhm trees.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2017

2016

On Undefined and Meaningless in Lambda Definability.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

2015

Approximation of Nested Fixpoints - A Coalgebraic View of Parametric Dataypes.

[BibT_eX]

[DOI]

Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

2013

Nominal Coalgebraic Data Types with Applications to Lambda Calculus.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

Completeness of Conversion between Reactive Programs for Ultrametric Models.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 11th International Conference, 2013

2012

Meaningless Sets in Infinitary Combinatory Logic.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

Pure type systems with corecursion on streams: from finite to infinitary normalisation.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2012

An Alpha-Corecursion Principle for the Infinitary Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science - 11th International Workshop, 2012

2011

Decomposing the Lattice of Meaningless Sets in the Infinitary Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the Logic, Language, Information and Computation, 2011

Weakening the Axiom of Overlap in Infinitary Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

2005

Continuity and Discontinuity in Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005

Order Structures on Böhm-Like Models.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 19th International Workshop, 2005

Infinitary Rewriting: From Syntax to Semantics.

[BibT_eX]

[DOI]

Proceedings of the Processes, 2005

2003

Infinitary lambda calculus and discrimination of Berarducci trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2002

Intersection types for lambda-trees.

[BibT_eX]

[DOI]

Steffen van Bakel

Franco Barbanera

Theor. Comput. Sci., 2002

An Extensional Böhm Model.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

2000

Böhm's theorem for Berarducci trees.

[BibT_eX]

[DOI]

Proceedings of the Computing: the Australasian Theory Symposium, 2000

1999

Meaningless Terms in Rewriting.

[BibT_eX]

[DOI]

Richard Kennaway

Vincent van Oostrom

J. Funct. Log. Program., 1999

1998

Types for trees.

[BibT_eX]

Franco Barbanera

Proceedings of the Programming Concepts and Methods, 1998

1997

Infinitary Lambda Calculus.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

1996

Comparing Curried and Uncurried Rewriting.

[BibT_eX]

[DOI]

J. Symb. Comput., 1996

1995

Transfinite Reductions in Orthogonal Term Rewriting Systems

[BibT_eX]

[DOI]

Inf. Comput., May, 1995

Reasoning about update logic.

[BibT_eX]

[DOI]

Jan van Eijck

J. Philos. Log., 1995

Infinitary Lambda Calculi and Böhm Models.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

1994

On the Adequacy of Graph Rewriting for Simulating Term Rewriting.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1994

Syntactic Definitions of Undefined: On Defining the Undefined.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computer Software, 1994

1992

Dynamic Interpretation and Hoare Deduction.

[BibT_eX]

[DOI]

Jan van Eijck

J. Log. Lang. Inf., 1992

1991

Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1988

A functional program for the fast Fourier transform.

[BibT_eX]

[DOI]

ACM SIGPLAN Notices, 1988

Intuitionistic Free Abelian Groups.

[BibT_eX]

[DOI]

Dirk van Dalen