Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Sam Lindley"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 3 (2023)
This paper introduces Hypersequent GV (HGV), a modular and extensible core calculus for functional programming with session types that enjoys deadlock freedom, confluence, and strong normalisation. HGV exploits hyper-environments, which are collectio
Externí odkaz:
https://doaj.org/article/58152a80515540a2869ace798f9c97fb
Autor:
Sam Lindley, J. Garrett Morris
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 155, Iss Proc. PLACES 2014, Pp 9-16 (2014)
Recently, Wadler presented a continuation-passing translation from a session-typed functional language, GV, to a process calculus based on classical linear logic, CP. However, this translation is one-way: CP is more expressive than GV. We propose an
Externí odkaz:
https://doaj.org/article/25d5bc93a6de48c7ba621546b3658263
Publikováno v:
Proceedings of the ACM on Programming Languages. 6:1639-1667
Effect handlers allow the programmer to implement computational effects, such as custom error handling, various forms of lightweight concurrency, and dynamic binding, inside the programming language. We introduce cpp-effects, a C++ library for effect
Publikováno v:
Emrich, F, Stolarek, J, Cheney, J & Lindley, S 2022, ' Constraint-based type inference for FreezeML ', Proceedings of the ACM on Programming Languages, vol. 6, no. ICFP, 111, pp. 570-595 . https://doi.org/10.1145/3547642
FreezeML is a new approach to first-class polymorphic type inference that employs term annotations to control when and how polymorphic types are instantiated and generalised. It conservatively extends Hindley-Milner type inference and was first prese
Publikováno v:
PPDP
23rd International Symposium on Principles and Practice of Declarative Programming
Choi, K, Cheney, J, Lindley, S & Reynders, B 2021, A Typed Slicing Compilation of the Polymorphic RPC Calculus . in Proceedings of the 23rd International Symposium on Principles and Practice of Declarative Programming (PPDP 2021) . 23rd International Symposium on Principles and Practice of Declarative Programming, Tallinn, Estonia, 6/08/21 . https://doi.org/10.1145/3479394.3479406
23rd International Symposium on Principles and Practice of Declarative Programming
Choi, K, Cheney, J, Lindley, S & Reynders, B 2021, A Typed Slicing Compilation of the Polymorphic RPC Calculus . in Proceedings of the 23rd International Symposium on Principles and Practice of Declarative Programming (PPDP 2021) . 23rd International Symposium on Principles and Practice of Declarative Programming, Tallinn, Estonia, 6/08/21 . https://doi.org/10.1145/3479394.3479406
The polymorphic RPC calculus allows programmers to write succinct multitier programs using polymorphic location constructs. However, until now it lacked an implementation. We develop an experimental programming language based on the polymorphic RPC c
Publikováno v:
Haskell
Valliappan, N, Russo, A & Lindley, S 2021, Practical Normalization by Evaluation for EDSLs . in Proceedings of the 14th ACM SIGPLAN International Haskell Symposium (Haskell 2021) . Virtual, Republic of Korea, pp. 56-70, ACM SIGPLAN Haskell Symposium 2021, 26/08/21 . https://doi.org/10.1145/3471874.3472983
Valliappan, N, Russo, A & Lindley, S 2021, Practical Normalization by Evaluation for EDSLs . in Proceedings of the 14th ACM SIGPLAN International Haskell Symposium (Haskell 2021) . Virtual, Republic of Korea, pp. 56-70, ACM SIGPLAN Haskell Symposium 2021, 26/08/21 . https://doi.org/10.1145/3471874.3472983
Embedded domain-specific languages (eDSLs) are typically implemented in a rich host language, such as Haskell, using a combination of deep and shallow embedding techniques. While such a combination enables programmers to exploit the execution mechani
Autor:
Sam Lindley, Max S. New
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 317
Publikováno v:
Hillerström, D, Lindley, S & Atkey, R 2020, ' Effect handlers via generalised continuations ', Journal of Functional Programming, vol. 30, e5, pp. 1-69 . https://doi.org/10.1017/S0956796820000040
Plotkin and Pretnar’s effect handlers offer a versatile abstraction for modular programming with user-defined effects. This paper focuses on foundations for implementing effect handlers, for the three different kinds of effect handlers that have be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f28c34ff9967db98106da2fdf6d6bada
https://www.pure.ed.ac.uk/ws/files/140406466/handlers.pdf
https://www.pure.ed.ac.uk/ws/files/140406466/handlers.pdf
Publikováno v:
Convent, L, Lindley, S, McLaughlin, C & McBride, C 2020, ' Doo bee doo bee doo ', Journal of Functional Programming, vol. 30, e9, pp. 1-53 . https://doi.org/10.1017/S0956796820000039
We explore the design and implementation of Frank, a strict functional programming language with a bidirectional effect type system designed from the ground up around a novel variant of Plotkin and Pretnar’s effect handler abstraction. Effect handl
Publikováno v:
Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation
Emrich, F, Lindley, S, Stolarek, J, Cheney, J & Coates, J 2020, FreezeML : Complete and Easy Type Inference for First-Class Polymorphism . in Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation . Association for Computing Machinery (ACM), pp. 423-437, 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, London, United Kingdom, 15/06/20 . https://doi.org/10.1145/3385412.3386003
PLDI
Emrich, F, Lindley, S, Stolarek, J, Cheney, J & Coates, J 2020, FreezeML : Complete and Easy Type Inference for First-Class Polymorphism . in Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation . Association for Computing Machinery (ACM), pp. 423-437, 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, London, United Kingdom, 15/06/20 . https://doi.org/10.1145/3385412.3386003
PLDI
ML is remarkable in providing statically typed polymorphism without the programmer ever having to write any type annotations. The cost of this parsimony is that the programmer is limited to a form of polymorphism in which quantifiers can occur only a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5bea7287ff18673400fc09a6d9808581