Zobrazeno 1 - 10
of 205
pro vyhledávání: '"Gibbons, Jeremy"'
Autor:
Gibbons, Jeremy, New, Max S.
Publikováno v:
EPTCS 360, 2022
This volume contains the proceedings of the Ninth Workshop on Mathematically Structured Functional Programming (MSFP 2022). The meeting took place on the 2nd of April as a satellite of European Joint Conferences on Theory & Practice of Software (ETAP
Externí odkaz:
http://arxiv.org/abs/2206.09534
Autor:
Gibbons, Jeremy
Publikováno v:
The Art, Science, and Engineering of Programming, 2022, Vol. 6, Issue 2, Article 7
Context: Reynolds showed us how to use continuation-passing style and defunctionalization to transform a recursive interpreter for a language into an abstract machine for programs in that language. The same techniques explain other programming tricks
Externí odkaz:
http://arxiv.org/abs/2111.10413
Autor:
Clarke, Bryce, Elkins, Derek, Gibbons, Jeremy, Loregian, Fosco, Milewski, Bartosz, Pillmore, Emily, Román, Mario
Publikováno v:
Compositionality, Volume 6 (2024) (February 23, 2024) compositionality:13530
Optics are bidirectional data accessors that capture data transformation patterns such as accessing subfields or iterating over containers. Profunctor optics are a particular choice of representation supporting modularity, meaning that we can constru
Externí odkaz:
http://arxiv.org/abs/2001.07488
Publikováno v:
The Art, Science, and Engineering of Programming, 2017, Vol. 1, Issue 2, Article 7
CONTEXT: Data accessors allow one to read and write components of a data structure, such as the fields of a record, the variants of a union, or the elements of a container. These data accessors are collectively known as optics; they are fundamental t
Externí odkaz:
http://arxiv.org/abs/1703.10857
Autor:
Piróg, Maciej, Gibbons, Jeremy
Publikováno v:
EPTCS 212, 2016, pp. 53-62
Push/enter and eval/apply are two calling conventions used in implementations of functional languages. In this paper, we explore the following observation: when considering functions with multiple arguments, the stack under the push/enter and eval/ap
Externí odkaz:
http://arxiv.org/abs/1606.06380
Bidirectional transformations (bx) have primarily been modeled as pure functions, and do not account for the possibility of the side-effects that are available in most programming languages. Recently several formulations of bx that use monads to acco
Externí odkaz:
http://arxiv.org/abs/1601.02484
Bidirectional transformations (bx) support principled consistency maintenance between data sources. Each data source corresponds to one perspective on a composite system, manifested by operations to 'get' and 'set' a view of the whole from that parti
Externí odkaz:
http://arxiv.org/abs/1505.02579
Autor:
Piróg, Maciej, Gibbons, Jeremy
Publikováno v:
EPTCS 76, 2012, pp. 90-111
In functional programming, monads are supposed to encapsulate computations, effectfully producing the final result, but keeping to themselves the means of acquiring it. For various reasons, we sometimes want to reveal the internals of a computation.
Externí odkaz:
http://arxiv.org/abs/1202.2922
Autor:
Gibbons, Jeremy
Publikováno v:
EPTCS 66, 2011, pp. 181-194
The maximum segment sum problem is to compute, given a list of integers, the largest of the sums of the contiguous segments of that list. This problem specification maps directly onto a cubic-time algorithm; however, there is a very elegant linear-ti
Externí odkaz:
http://arxiv.org/abs/1109.0782