Intuitionistic Free Abelian Groups. - Dirk van Dalen; Fer-Jan de Vries (Math. Log. Q., 1988)

A functional program for the fast Fourier transform. - Fer-Jan de Vries (ACM SIGPLAN Notices, 1988)

Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract). - Richard Kennaway; Jan Willem Klop; M. Ronan Sleep; Fer-Jan de Vries (RTA, 1991)

Dynamic Interpretation and Hoare Deduction. - Jan van Eijck; Fer-Jan de Vries (J. Log. Lang. Inf., 1992)

Syntactic Definitions of Undefined: On Defining the Undefined. - Zena M. Ariola; Richard Kennaway; Jan Willem Klop; M. Ronan Sleep; Fer-Jan de Vries (TACS, 1994)

On the Adequacy of Graph Rewriting for Simulating Term Rewriting. - Richard Kennaway; Jan Willem Klop; M. Ronan Sleep; Fer-Jan de Vries (ACM Trans. Program. Lang. Syst., 1994)

Infinitary Lambda Calculi and Böhm Models. - Richard Kennaway; Jan Willem Klop; M. Ronan Sleep; Fer-Jan de Vries (RTA, 1995)

Reasoning about update logic. - Jan van Eijck; Fer-Jan de Vries (J. Philos. Log., 1995)

Transfinite Reductions in Orthogonal Term Rewriting Systems - Richard Kennaway; Jan Willem Klop; M. Ronan Sleep; Fer-Jan de Vries (Inf. Comput., 1995)

Comparing Curried and Uncurried Rewriting. - Richard Kennaway; Jan Willem Klop; M. Ronan Sleep; Fer-Jan de Vries (J. Symb. Comput., 1996)

Infinitary Lambda Calculus. - Richard Kennaway; Jan Willem Klop; M. Ronan Sleep; Fer-Jan de Vries (Theor. Comput. Sci., 1997)

Types for trees. - Franco Barbanera; Mariangiola Dezani-Ciancaglini; Fer-Jan de Vries (PROCOMET, 1998)

Meaningless Terms in Rewriting. - Richard Kennaway; Vincent van Oostrom; Fer-Jan de Vries (J. Funct. Log. Program., 1999)

Böhm's theorem for Berarducci trees. - Mariangiola Dezani-Ciancaglini; Paula Severi; Fer-Jan de Vries (CATS, 2000)

An Extensional Böhm Model. - Paula Severi; Fer-Jan de Vries (RTA, 2002)

Intersection types for lambda-trees. - Steffen van Bakel; Franco Barbanera; Mariangiola Dezani-Ciancaglini; Fer-Jan de Vries (Theor. Comput. Sci., 2002)

Infinitary lambda calculus and discrimination of Berarducci trees. - Mariangiola Dezani-Ciancaglini; Paula Severi; Fer-Jan de Vries (Theor. Comput. Sci., 2003)

Infinitary Rewriting: From Syntax to Semantics. - Richard Kennaway; Paula Severi; M. Ronan Sleep; Fer-Jan de Vries (Processes, Terms and Cycles, 2005)

Order Structures on Böhm-Like Models. - Paula Severi; Fer-Jan de Vries (CSL, 2005)

Continuity and Discontinuity in Lambda Calculus. - Paula Severi; Fer-Jan de Vries (TLCA, 2005)

Weakening the Axiom of Overlap in Infinitary Lambda Calculus. - Paula Severi; Fer-Jan de Vries (RTA, 2011)

Decomposing the Lattice of Meaningless Sets in the Infinitary Lambda Calculus. - Paula Severi; Fer-Jan de Vries (WoLLIC, 2011)

An Alpha-Corecursion Principle for the Infinitary Lambda Calculus. - Alexander Kurz 001; Daniela Petrisan; Paula Severi; Fer-Jan de Vries (CMCS, 2012)

Pure type systems with corecursion on streams: from finite to infinitary normalisation. - Paula Severi; Fer-Jan de Vries (ICFP, 2012)

Meaningless Sets in Infinitary Combinatory Logic. - Paula Severi; Fer-Jan de Vries (RTA, 2012)

Completeness of Conversion between Reactive Programs for Ultrametric Models. - Paula Severi; Fer-Jan de Vries (TLCA, 2013)

Nominal Coalgebraic Data Types with Applications to Lambda Calculus. - Alexander Kurz 001; Daniela Petrisan; Paula Severi; Fer-Jan de Vries (Log. Methods Comput. Sci., 2013)

Approximation of Nested Fixpoints - A Coalgebraic View of Parametric Dataypes. - Alexander Kurz 001; Alberto Pardo; Daniela Petrisan; Paula Severi; Fer-Jan de Vries (CALCO, 2015)

On Undefined and Meaningless in Lambda Definability. - Fer-Jan de Vries (FSCD, 2016)

The infinitary lambda calculus of the infinite eta Böhm trees. - Paula Severi; Fer-Jan de Vries (Math. Struct. Comput. Sci., 2017)

Many-valued logics inside λ-calculus: Church's rescue of Russell with B{ "}ohm trees. - Fer-Jan de Vries (CoRR, 2018)

Encoding many-valued logic in λ-calculus. - Fer-Jan de Vries (Log. Methods Comput. Sci., 2021)