File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Functional programming with structured graphs

TitleFunctional programming with structured graphs
Authors
KeywordsGraphs
Haskell
Parametric Hoas
Issue Date2012
Citation
Acm Sigplan Notices, 2012, v. 47 n. 9, p. 77-88 How to Cite?
AbstractThis paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit definition and manipulation of cycles and/or sharing, and offer a practical and convenient way to program graphs in functional programming languages like Haskell. The representation of sharing and cycles (edges) employs recursive binders and uses an encoding inspired by para- metric higher-order abstract syntax. Unlike traditional approaches based on mutable references or node/edge lists, well-formedness of the graph structure is ensured statically and reasoning can be done with standard functional programming techniques. Since the binding structure is generic, we can define many useful generic combinators for manipulating structured graphs. We give applications and show how to reason about structured graphs. Copyright © 2012 ACM.
Persistent Identifierhttp://hdl.handle.net/10722/188502
ISSN
2015 SCImago Journal Rankings: 0.490
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorOliveira, BCDSen_US
dc.contributor.authorCook, WRen_US
dc.date.accessioned2013-09-03T04:08:45Z-
dc.date.available2013-09-03T04:08:45Z-
dc.date.issued2012en_US
dc.identifier.citationAcm Sigplan Notices, 2012, v. 47 n. 9, p. 77-88en_US
dc.identifier.issn1523-2867en_US
dc.identifier.urihttp://hdl.handle.net/10722/188502-
dc.description.abstractThis paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit definition and manipulation of cycles and/or sharing, and offer a practical and convenient way to program graphs in functional programming languages like Haskell. The representation of sharing and cycles (edges) employs recursive binders and uses an encoding inspired by para- metric higher-order abstract syntax. Unlike traditional approaches based on mutable references or node/edge lists, well-formedness of the graph structure is ensured statically and reasoning can be done with standard functional programming techniques. Since the binding structure is generic, we can define many useful generic combinators for manipulating structured graphs. We give applications and show how to reason about structured graphs. Copyright © 2012 ACM.en_US
dc.languageengen_US
dc.relation.ispartofACM SIGPLAN Noticesen_US
dc.subjectGraphsen_US
dc.subjectHaskellen_US
dc.subjectParametric Hoasen_US
dc.titleFunctional programming with structured graphsen_US
dc.typeConference_Paperen_US
dc.identifier.emailOliveira, BCDS: oliveira@comp.nus.edu.sgen_US
dc.identifier.authorityOliveira, BCDS=rp01786en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1145/2398856.2364541en_US
dc.identifier.scopuseid_2-s2.0-84870408020en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-84870408020&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume47en_US
dc.identifier.issue9en_US
dc.identifier.spage77en_US
dc.identifier.epage88en_US
dc.identifier.isiWOS:000311296000009-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridOliveira, BCDS=12239474400en_US
dc.identifier.scopusauthoridCook, WR=11939670900en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats