About: Zipper (data structure)

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Zipper (data structure) Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatDataStructures, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FZipper_%28data_structure%29&invfp=IFP_OFF&sas=SAME_AS_OFF

A zipper is a technique of representing an aggregate data structure so that it is convenient for writing programs that traverse the structure arbitrarily and update its contents, especially in purely functional programming languages. The zipper was described by Gérard Huet in 1997. It includes and generalizes the gap buffer technique sometimes used with arrays.

Attributes	Values
rdf:type	topical concept yago:Abstraction100002137 yago:Arrangement105726596 yago:Cognition100023271 yago:DataStructure105728493 yago:PsychologicalFeature100023100 yago:Structure105726345 yago:WikicatDataStructures
rdfs:label	Zipper (data structure) (en)
rdfs:comment	A zipper is a technique of representing an aggregate data structure so that it is convenient for writing programs that traverse the structure arbitrarily and update its contents, especially in purely functional programming languages. The zipper was described by Gérard Huet in 1997. It includes and generalizes the gap buffer technique sometimes used with arrays. (en)
dcterms:subject	Functional data structures Functional programming
Wikipage page ID	7872003 (xsd:integer)
Wikipage revision ID	1076482056 (xsd:integer)
Link from a Wikipage to another Wikipage	Calculus Boolean data type Derivative Intuitionistic type theory Inversion of control Power rule Generic programming Clojure Functional data structures Function type Sum rule in differentiation Sum type Functional programming Tree (data structure) Data structure Gap buffer Least fixed point Focus (computing) Journal of Functional Programming Gérard Huet Haskell State machine Automated theorem prover Window (computing) Recursive data type Xmonad Sentinel node Object copying Product type Filesystem List (computing) Derivative (generalizations) Purely functional programming language Decategorification Structural editor dbr:Constructor_operation dbr:Observer_operation
Link from a Wikipage to an external page	http://donsbot.wordpress.com/2007/05/17/roll-your-own-window-manager-tracking-focus-with-a-zipper/7 http://sigfpe.blogspot.com/2006/09/infinitesimal-types.html https://www.cs.tufts.edu/~nr/pubs/zipcfg-abstract.html http://www.st.cs.uni-sb.de/edu/seminare/2005/advanced-fp/docs/huet-zipper.pdf%7Ctitle=Functional http://en.wikibooks.org/wiki/Haskell/Zippers https://xlinux.nist.gov/dads/HTML/zipper.html http://www.haskell.org/haskellwiki/Zipper
sameAs	Zipper (data structure) Zipper (data structure) Zipper (data structure) Zipper (data structure) Zipper (data structure) Zipper (data structure)
dbp:wikiPageUsesTemplate	dbt:Cite_journal dbt:Math dbt:Mvar dbt:Reflist dbt:Use_dmy_dates dbt:Val dbt:Wikibooks
has abstract	A zipper is a technique of representing an aggregate data structure so that it is convenient for writing programs that traverse the structure arbitrarily and update its contents, especially in purely functional programming languages. The zipper was described by Gérard Huet in 1997. It includes and generalizes the gap buffer technique sometimes used with arrays. The zipper technique is general in the sense that it can be adapted to lists, trees, and other recursively defined data structures.Such modified data structures are usually referred to as "a tree with zipper" or "a list with zipper" to emphasize that the structure is conceptually a tree or list, while the zipper is a detail of the implementation. A layperson's explanation for a tree with zipper would be an ordinary computer filesystem with operations to go to parent (often cd ..), and the possibility to go downwards (cd subdirectory). The zipper is the pointer to the current path. Behind the scenes the zippers are efficient when making (functional) changes to a data structure, where a new, slightly changed, data structure is returned from an edit operation (instead of making a change in the current data structure). (en)
gold:hypernym	Technique
prov:wasDerivedFrom	wikipedia-en:Zipper_(data_structure)?oldid=1076482056&ns=0
page length (characters) of wiki page	12357 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Zipper_(data_structure)
is Link from a Wikipage to another Wikipage of	List of data structures Generalizations of the derivative Monad (functional programming) Gap buffer Purely functional data structure Zipper (disambiguation) Zipper data structure Splay tree Xmonad List of terms relating to algorithms and data structures Finger tree Zipper (datastructure) Zipper datastructure
is Wikipage redirect of	Zipper data structure Zipper (datastructure) Zipper datastructure
is Wikipage disambiguates of	Zipper (disambiguation)
is foaf:primaryTopic of	wikipedia-en:Zipper_(data_structure)

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software