default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Longley
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2015
[b1]John Longley, Dag Normann:
Higher-Order Computability. Theory and Applications of Computability, Springer 2015, ISBN 978-3-662-47991-9, pp. 3-546
Journal Articles
- 2024
- [j8]Daniel Hillerström
, Sam Lindley, John Longley:
Asymptotic speedup via effect handlers. J. Funct. Program. 34 (2024) - 2020
- [j7]Daniel Hillerström, Sam Lindley, John Longley:
Effects for efficiency: asymptotic speedup with first-class control. Proc. ACM Program. Lang. 4(ICFP): 100:1-100:29 (2020) - 2019
- [j6]John Longley:
Bar recursion is not computable via iteration. Comput. 8(2): 119-153 (2019) - 2018
- [j5]John Longley:
The recursion hierarchy for PCF is strict. Log. Methods Comput. Sci. 14(3) (2018) - 2014
- [j4]John Longley:
Computability structures, simulations and realizability. Math. Struct. Comput. Sci. 24(2) (2014) - 2007
- [j3]John Longley:
On the ubiquity of certain total type structures. Math. Struct. Comput. Sci. 17(5): 841-953 (2007) - 2002
- [j2]John Longley:
The sequentially realizable functionals. Ann. Pure Appl. Log. 117(1-3): 1-93 (2002) - 1997
- [j1]Simon Finn, Michael P. Fourman, John Longley:
Partial Functions in a Total Setting. J. Autom. Reason. 18(1): 85-104 (1997)
Conference and Workshop Papers
- 2009
- [c8]John Longley:
Some Programming Languages Suggested by Game Models (Extended Abstract). MFPS 2009: 117-134 - 2008
- [c7]John Longley:
Interpreting Localized Computational Effects Using Operators of Higher Type. CiE 2008: 389-402 - 2004
- [c6]John Longley, Randy Pollack:
Reasoning About CBV Functional Programs in Isabelle/HOL. TPHOLs 2004: 201-216 - 2002
- [c5]John Longley:
On the Ubiquity of Certain Total Type Structures: (Extended Abstract). Workshop on Domains 2002: 87-109 - 2000
- [c4]Furio Honsell, John Longley, Donald Sannella, Andrzej Tarlecki:
Constructive Data Refinement in Typed Lambda Calculus. FoSSaCS 2000: 161-176 - 1999
- [c3]John Longley:
When is a Functional Program Not a Functional Program? ICFP 1999: 1-7 - [c2]John Longley:
Matching typed and untyped realizability. Realizability Semantics and Applications@FLoC 1999: 74-100 - 1998
- [c1]John Longley:
Matching typed and untyped realizability. Workshop on Domains 1998: 109-132
Informal and Other Publications
- 2020
- [i4]Daniel Hillerström, Sam Lindley, John Longley:
Effects for Efficiency: Asymptotic Speedup with First-Class Control. CoRR abs/2007.00605 (2020) - 2018
- [i3]John Longley:
Bar recursion is not computable via iteration. CoRR abs/1804.07277 (2018) - [i2]John Longley:
The encodability hierarchy for PCF types. CoRR abs/1806.00344 (2018) - 2016
- [i1]John Longley:
The recursion hierarchy for PCF is strict. CoRR abs/1607.04611 (2016)
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-05-06 21:14 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:
