default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFer-Jan de Vries
Person information
- affiliation: University of Leicester, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j14]Fer-Jan de Vries:
Encoding many-valued logic in λ-calculus. Log. Methods Comput. Sci. 17(2): 25 (2021)
2010 – 2019
- 2018
- [i1]Fer-Jan de Vries:
Many-valued logics inside λ-calculus: Church's rescue of Russell with B{\"}ohm trees. CoRR abs/1810.07667 (2018) - 2017
- [j13]Paula Severi, Fer-Jan de Vries:
The infinitary lambda calculus of the infinite eta Böhm trees. Math. Struct. Comput. Sci. 27(5): 681-733 (2017) - 2016
- [c18]Fer-Jan de Vries:
On Undefined and Meaningless in Lambda Definability. FSCD 2016: 18:1-18:15 - 2015
- [c17]Alexander Kurz
, Alberto Pardo, Daniela Petrisan, Paula Severi, Fer-Jan de Vries:
Approximation of Nested Fixpoints - A Coalgebraic View of Parametric Dataypes. CALCO 2015: 205-220 - 2013
- [j12]Alexander Kurz, Daniela Petrisan, Paula Severi, Fer-Jan de Vries:
Nominal Coalgebraic Data Types with Applications to Lambda Calculus. Log. Methods Comput. Sci. 9(4) (2013) - [c16]Paula Severi, Fer-Jan de Vries:
Completeness of Conversion between Reactive Programs for Ultrametric Models. TLCA 2013: 221-235 - 2012
- [c15]Alexander Kurz, Daniela Petrisan, Paula Severi, Fer-Jan de Vries:
An Alpha-Corecursion Principle for the Infinitary Lambda Calculus. CMCS 2012: 130-149 - [c14]Paula Severi, Fer-Jan de Vries:
Pure type systems with corecursion on streams: from finite to infinitary normalisation. ICFP 2012: 141-152 - [c13]Paula Severi, Fer-Jan de Vries:
Meaningless Sets in Infinitary Combinatory Logic. RTA 2012: 288-304 - 2011
- [c12]Paula Severi, Fer-Jan de Vries:
Weakening the Axiom of Overlap in Infinitary Lambda Calculus. RTA 2011: 313-328 - [c11]Paula Severi, Fer-Jan de Vries:
Decomposing the Lattice of Meaningless Sets in the Infinitary Lambda Calculus. WoLLIC 2011: 210-227
2000 – 2009
- 2005
- [c10]Richard Kennaway, Paula Severi, M. Ronan Sleep, Fer-Jan de Vries:
Infinitary Rewriting: From Syntax to Semantics. Processes, Terms and Cycles 2005: 148-172 - [c9]Paula Severi, Fer-Jan de Vries:
Order Structures on Böhm-Like Models. CSL 2005: 103-118 - [c8]Paula Severi, Fer-Jan de Vries:
Continuity and Discontinuity in Lambda Calculus. TLCA 2005: 369-385 - 2003
- [j11]Mariangiola Dezani-Ciancaglini, Paula Severi, Fer-Jan de Vries:
Infinitary lambda calculus and discrimination of Berarducci trees. Theor. Comput. Sci. 298(2): 275-302 (2003) - 2002
- [j10]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) - [c7]Paula Severi, Fer-Jan de Vries:
An Extensional Böhm Model. RTA 2002: 159-173 - 2000
- [c6]Mariangiola Dezani-Ciancaglini, Paula Severi, Fer-Jan de Vries:
Böhm's theorem for Berarducci trees. CATS 2000: 34-57
1990 – 1999
- 1999
- [j9]Richard Kennaway, Vincent van Oostrom, Fer-Jan de Vries:
Meaningless Terms in Rewriting. J. Funct. Log. Program. 1999(1) (1999) - 1998
- [c5]Franco Barbanera, Mariangiola Dezani-Ciancaglini, Fer-Jan de Vries:
Types for trees. PROCOMET 1998: 11-29 - 1997
- [j8]Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries:
Infinitary Lambda Calculus. Theor. Comput. Sci. 175(1): 93-125 (1997) - 1996
- [j7]Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries:
Comparing Curried and Uncurried Rewriting. J. Symb. Comput. 21(1): 15-39 (1996) - [c4]Richard Kennaway, Vincent van Oostrom, Fer-Jan de Vries:
Meaningless Terms in Rewriting. ALP 1996: 254-268 - 1995
- [j6]Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries:
Transfinite Reductions in Orthogonal Term Rewriting Systems. Inf. Comput. 119(1): 18-38 (1995) - [j5]Jan van Eijck, Fer-Jan de Vries:
Reasoning about update logic. J. Philos. Log. 24(1): 19-45 (1995) - [c3]Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries:
Infinitary Lambda Calculi and Böhm Models. RTA 1995: 257-270 - 1994
- [j4]Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries:
On the Adequacy of Graph Rewriting for Simulating Term Rewriting. ACM Trans. Program. Lang. Syst. 16(3): 493-523 (1994) - [c2]Zena M. Ariola, Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries:
Syntactic Definitions of Undefined: On Defining the Undefined. TACS 1994: 543-554 - 1992
- [j3]Jan van Eijck, Fer-Jan de Vries:
Dynamic Interpretation and Hoare Deduction. J. Log. Lang. Inf. 1(1): 1-44 (1992) - 1991
- [c1]Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries:
Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract). RTA 1991: 1-12
1980 – 1989
- 1988
- [j2]Dirk van Dalen, Fer-Jan de Vries:
Intuitionistic Free Abelian Groups. Math. Log. Q. 34(1): 3-12 (1988) - [j1]Fer-Jan de Vries:
A functional program for the fast Fourier transform. ACM SIGPLAN Notices 23(1): 67-74 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
