Generic parsing combinators

Parsing combinators are a well known technique to the functional programming com munity Several de nitions of them were proposed and each one has its own advantages From the programmer point of view this wide range of possibilities implies that she needs to mantain several di erent modules wit...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Martínez López, Pablo E.
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 1997
Materias:
Ciencias Informáticas
PROGRAMMING TECHNIQUES
Functional Programming
Parsing Combinators
Monads
Multi-parameter Type Classes
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/24130
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-24130
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
PROGRAMMING TECHNIQUES
Functional Programming
Parsing Combinators
Monads
Multi-parameter Type Classes
spellingShingle Ciencias Informáticas
PROGRAMMING TECHNIQUES
Functional Programming
Parsing Combinators
Monads
Multi-parameter Type Classes
Martínez López, Pablo E.
Generic parsing combinators
topic_facet Ciencias Informáticas
PROGRAMMING TECHNIQUES
Functional Programming
Parsing Combinators
Monads
Multi-parameter Type Classes
description Parsing combinators are a well known technique to the functional programming com munity Several de nitions of them were proposed and each one has its own advantages From the programmer point of view this wide range of possibilities implies that she needs to mantain several di erent modules with several di erent namespaces but all aimed to solve the same problem Type classes and constructor classes were introduced in Functional Programming as a mean to provide overloading that is sharing of names between functions of di erent types Several design decisions can be made when implementing class systems In particular multi parameter type classes is a di cult feature to add and its addition makes sense only if extra expressiveness is achieved with them This paper proposes the use of the class system extended with multi parameter type classes to unify the de nition of parsing combinators The advantage is that di erent solutions can share their interfaces thus simplifying the programmer s activity She uses this common interface and the actual implementation is decided only changing the type signature Moreover this use of the class system is an example of the usefulness of multi parameter type classes
format Objeto de conferencia
Objeto de conferencia
author Martínez López, Pablo E.
author_facet Martínez López, Pablo E.
author_sort Martínez López, Pablo E.
title Generic parsing combinators
title_short Generic parsing combinators
title_full Generic parsing combinators
title_fullStr Generic parsing combinators
title_full_unstemmed Generic parsing combinators
title_sort generic parsing combinators
publishDate 1997
url http://sedici.unlp.edu.ar/handle/10915/24130
work_keys_str_mv AT martinezlopezpabloe genericparsingcombinators
bdutipo_str Repositorios
_version_ 1764820466656083968

Ejemplares similares