Sökning: onr:"swepub:oai:research.chalmers.se:8751ef48-473f-4086-97c9-d895c4905548" >
Names For Free - Po...
Names For Free - Polymorphic Views of Names and Binders
-
- Bernardy, Jean-Philippe, 1978 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
- Pouillard, Nicolas, 1983 (författare)
- IT-Universitetet i Kobenhavn,IT University of Copenhagen
-
(creator_code:org_t)
- ISBN 9781450323833
- 2013-09-23
- 2013
- Engelska.
-
Ingår i: SIGPLAN Notices (ACM Special Interest Group on Programming Languages). - New York, NY, USA : ACM. - 0730-8566. - 9781450323833 ; 48:12, s. 13-24
- Relaterad länk:
-
http://dx.doi.org/10...
-
visa fler...
-
https://research.cha...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- We propose a novel technique to represent names and binders inHaskell. The dynamic (run-time) representation is based on de Bruijnindices, but it features an interface to write and manipulatevariables conviently, using Haskell-level lambdas and variables. Thekey idea is to use rich types: a subterm with an additional free variableis viewed either as $\forall v. v \rightarrow \mathsf{Term} (a + v)$or $\exists v. v \times \mathsf{Term} (a + v)$ depending on weather itis constructed or analysed. We demonstrate on a number of exampleshow this approach approach permits to express terms construction and manipulation in a natural way, while retaining the good properties ofrepresentations based on de Bruijn indices.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- type-classes
- polymorphism
- name binding
- parametricity
- nested types
Publikations- och innehållstyp
- kon (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas