Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Jeremy Yallop"'
Autor:
Runhang Li, Jeremy Yallop
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 294, Iss Proc. ML 2017, Pp 1-14 (2019)
We propose a harmonious extension of OCaml's 'open' construct. OCaml's existing construct 'open M' imports the names exported by the module 'M' into the current scope. At present 'M' is required to be the path to a module. We propose extending 'open
Externí odkaz:
https://doaj.org/article/5e9bc43b75484151bfbdc6d35aa4262e
Autor:
Jeremy Yallop, Stephen Dolan
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 294, Iss Proc. ML 2017, Pp 74-85 (2019)
First class type equalities, in the form of generalized algebraic data types (GADTs), are commonly found in functional programs. However, first-class representations of other relations between types, such as subtyping, are not yet directly supported
Externí odkaz:
https://doaj.org/article/8388c5ea1abb4de493ae96804dd0a4bc
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 198, Iss Proc. ML/OCaml 2014, Pp 22-63 (2015)
We present modular implicits, an extension to the OCaml language for ad-hoc polymorphism inspired by Scala implicits and modular type classes. Modular implicits are based on type-directed implicit module parameters, and elaborate straightforwardly in
Externí odkaz:
https://doaj.org/article/354ce377d2544764bc7d7b5da8adaae1
Publikováno v:
Xie, N, Pickering, M T, Loh, A, Wu, N, Yallop, J & Wang, M 2022, ' Staging with Class : A Specification for Typed Template Haskell ', Proceedings of the ACM on Programming Languages, vol. 6, no. POPL, 61 . https://doi.org/10.1145/3498723
Multi-stage programming using typed code quotation is an established technique for writing optimizing code generators with strong type-safety guarantees. Unfortunately, quotation in Haskell interacts poorly with type classes, making it difficult to w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::efd717a6fa9f87294252da6fa7bfc8d7
https://www.repository.cam.ac.uk/handle/1810/333404
https://www.repository.cam.ac.uk/handle/1810/333404
Publikováno v:
Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, 2021, 5 (POPL), pp.1-29. ⟨10.1145/3434326⟩
Proceedings of the ACM on Programming Languages, ACM, 2021, 5 (POPL), pp.1-29. ⟨10.1145/3434326⟩
Proceedings of the ACM on Programming Languages, 2021, 5 (POPL), pp.1-29. ⟨10.1145/3434326⟩
Proceedings of the ACM on Programming Languages, ACM, 2021, 5 (POPL), pp.1-29. ⟨10.1145/3434326⟩
In call-by-value languages, some mutually-recursive value definitions can be safely evaluated to build recursive functions or cyclic data structures, but some definitions (let rec x = x + 1) contain vicious circles and their evaluation fails at runti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::41f8245f025430f39e082e1dc2ed217a
https://www.repository.cam.ac.uk/handle/1810/317229
https://www.repository.cam.ac.uk/handle/1810/317229
Publikováno v:
Yallop, J, von Glehn, T & Kammar, O 2018, ' Partially-Static Data As Free Extension of Algebras ', Proceedings of the ACM on Programming Languages, vol. 2, no. ICFP, 100 . https://doi.org/10.1145/3236795
Partially-static data structures are a well-known technique for improving binding times. However, they are often defined in an ad-hoc manner, without a unifying framework to ensure full use of the equations associated with each operation. We present
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51836df3f68564aad3526a6ebd6f2426
https://doi.org/10.1145/3236795
https://doi.org/10.1145/3236795
Autor:
Jeremy Yallop, Leo White
We describe our experience teaching an advanced typed functional programming course based around the use of System Fω as a programming language.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93cd8d0ccf45be85c63b83d099d74e79
Autor:
Jeremy Yallop, Runhang Li
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 294, Iss Proc. ML 2017, Pp 1-14 (2019)
We propose a harmonious extension of OCaml's 'open' construct. OCaml's existing construct 'open M' imports the names exported by the module 'M' into the current scope. At present 'M' is required to be the path to a module. We propose extending 'open'
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d14d6b4d79a967a3bd7773da9bbb0aaa
http://arxiv.org/abs/1905.06543
http://arxiv.org/abs/1905.06543
Publikováno v:
PLDI
In this paper, we recall the definition of the context-free expressions (or µ-regular expressions), an algebraic presentation of the context-free languages. Then, we define a core type system for the context-free expressions which gives a compositio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c259e8ad82f7dd8fe01706369ef9869a
Autor:
Oleg Kiselyov, Jeremy Yallop
Publikováno v:
PEPM@POPL
Many functional programs — state machines [Krishnamurthi 2006], top-down and bottom-up parsers [Hinze and Paterson 2003; Hutton and Meijer 1996], evaluators [Abelson et al. 1984], GUI initialization graphs [Syme 2006], &c. — are conveniently expr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33028477c5dae686a413edc4e668a691
https://doi.org/10.1145/3294032.3294078
https://doi.org/10.1145/3294032.3294078