default search action
Jeremy Yallop
Person information
- affiliation: University of Cambridge, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Nicolas Chataing
, Stephen Dolan
Unboxed Data Constructors: Or, How cpp Decides a Halting Problem. Proc. ACM Program. Lang. 8(POPL): 1509-1539 (2024) - 2023
- [j10]Ningning Xie
MacoCaml: Staging Composable and Compilable Macros. Proc. ACM Program. Lang. 7(ICFP): 604-648 (2023) - [j9]Yulong Huang
Defunctionalization with Dependent Types. Proc. ACM Program. Lang. 7(PLDI): 516-538 (2023) - [j8]Jeremy Yallop
flap: A Deterministic Parser with Fused Lexing. Proc. ACM Program. Lang. 7(PLDI): 1194-1217 (2023) - [i8]Yulong Huang, Jeremy Yallop:
Defunctionalization with Dependent Types. CoRR abs/2304.04574 (2023) - [i7]Jeremy Yallop, Ningning Xie, Neel Krishnaswami:
flap: A Deterministic Parser with Fused Lexing. CoRR abs/2304.05276 (2023) - [i6]Guillaume Allais, Edwin C. Brady, Nathan Corbyn, Ohad Kammar, Jeremy Yallop:
Frex: dependently-typed algebraic simplification. CoRR abs/2306.15375 (2023) - [i5]Nicolas Chataing, Stephen Dolan, Gabriel Scherer, Jeremy Yallop:
Unboxed data constructors - or, how cpp decides a halting problem. CoRR abs/2311.07369 (2023) - 2022
- [j7]Ningning Xie, Matthew Pickering, Andres Löh, Nicolas Wu
Staging with class: a specification for typed template Haskell. Proc. ACM Program. Lang. 6(POPL): 1-30 (2022) - [i4]Oleg Kiselyov, Jeremy Yallop:
let (rec) insertion without Effects, Lights or Magic. CoRR abs/2201.00495 (2022) - 2021
- [j6]Alban Reynaud, Gabriel Scherer
A practical mode system for recursive definitions. Proc. ACM Program. Lang. 5(POPL): 1-29 (2021)
2010 – 2019
- 2019
- [j5]Jeremy Yallop, Leo White:
Lambda: the ultimate sublanguage (experience report). Proc. ACM Program. Lang. 3(ICFP): 116:1-116:17 (2019) - [c16]Jeremy Yallop, Oleg Kiselyov:
Generating mutually recursive definitions. PEPM@POPL 2019: 75-81 - [c15]Neelakantan R. Krishnaswami, Jeremy Yallop:
A typed, algebraic approach to parsing. PLDI 2019: 379-393 - [i3]Gabriel Radanne, Thomas Gazagnaire, Anil Madhavapeddy, Jeremy Yallop, Richard Mortier, Hannes Mehnert, Mindy Preston, David J. Scott:
Programming Unikernels in the Large via Functor Driven Development. CoRR abs/1905.02529 (2019) - 2018
- [j4]Jeremy Yallop, Tamara von Glehn, Ohad Kammar:
Partially-static data as free extension of algebras. Proc. ACM Program. Lang. 2(ICFP): 100:1-100:30 (2018) - [j3]Jeremy Yallop, David Sheets, Anil Madhavapeddy
A modular foreign function interface. Sci. Comput. Program. 164: 82-97 (2018) - [i2]Alban Reynaud, Gabriel Scherer, Jeremy Yallop:
A right-to-left type system for mutually-recursive value definitions. CoRR abs/1811.08134 (2018) - 2017
- [j2]Jeremy Yallop:
Staged generic programming. Proc. ACM Program. Lang. 1(ICFP): 29:1-29:29 (2017) - [c14]Runhang Li, Jeremy Yallop:
Extending OCaml's 'open'. ML/OCaml 2017: 1-14 - [c13]Jeremy Yallop, Stephen Dolan:
First-Class Subtypes. ML/OCaml 2017: 74-85 - [e2]Ulrik Pagh Schultz, Jeremy Yallop:
Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2017, Paris, France, January 18-20, 2017. ACM 2017, ISBN 978-1-4503-4721-1 [contents] - [e1]Jeremy Yallop, Damien Doligez:
Proceedings ML Family / OCaml Users and Developers workshops, ML Family/OCaml 2015, Vancouver, Canada, 3rd & 4th September 2015. EPTCS 241, 2017 [contents] - 2016
- [c12]Jeremy Yallop, David Sheets, Anil Madhavapeddy
Declarative Foreign Function Binding Through Generic Programming. FLOPS 2016: 198-214 - [c11]Jeremy Yallop, Hai Liu:
Causal commutative arrows revisited. Haskell 2016: 21-32 - [c10]David Kaloper-Mersinjak, Jeremy Yallop:
Generic partially-static data (extended abstract). TyDe@ICFP 2016: 39-40 - [c9]Jeremy Yallop:
Staging generic programming. PEPM 2016: 85-96 - [i1]Andrej Bauer, Martin Hofmann, Matija Pretnar, Jeremy Yallop:
From Theory to Practice of Algebraic Effects and Handlers (Dagstuhl Seminar 16112). Dagstuhl Reports 6(3): 44-58 (2016) - 2014
- [c8]Jeremy Yallop, Leo White:
Lightweight Higher-Kinded Polymorphism. FLOPS 2014: 119-135 - [c7]Leo White, Frédéric Bour, Jeremy Yallop:
Modular implicits. ML/OCaml 2014: 22-63 - 2010
- [b1]Jeremy Yallop:
Abstraction for web programming. University of Edinburgh, UK, 2010 - [j1]Sam Lindley
The arrow calculus. J. Funct. Program. 20(1): 51-69 (2010)
2000 – 2009
- 2009
- [c6]Robert Atkey
Unembedding domain-specific languages. Haskell 2009: 37-48 - 2008
- [c5]Ezra Cooper, Sam Lindley, Philip Wadler, Jeremy Yallop:
The Essence of Form Abstraction. APLAS 2008: 205-220 - [c4]Sam Lindley
Idioms are Oblivious, Arrows are Meticulous, Monads are Promiscuous. MSFP@ICALP 2008: 97-117 - 2007
- [c3]Jeremy Yallop:
Practical generic programming in OCaml. ML 2007: 83-94 - 2006
- [c2]Ezra Cooper, Sam Lindley, Philip Wadler, Jeremy Yallop:
Links: Web Programming Without Tiers. FMCO 2006: 266-296 - 2005
- [c1]Jeremy Yallop, Anna Korhonen, Ted Briscoe:
Automatic Acquisition of Adjectival Subcategorization from Corpora. ACL 2005: 614-621
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 22:47 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: