The Zipper

DOI10.1017/S0956796897002864zbMATH Open0893.68014OpenAlexW2912949875WikidataQ29036237 ScholiaQ29036237MaRDI QIDQ4376491FDOQ4376491

Authors: Gérard Huet 

Publication date: 11 February 1998

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796897002864

Recommendations

• Clowns to the left of me, jokers to the right (pearl)
• Generic Haskell: applications.
• Finger trees: a simple general-purpose data structure
• scientific article; zbMATH DE number 3845635
• scientific article; zbMATH DE number 2154394

zbMATH Keywords

functional arraysZipper

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited In (45)

• Proofs, upside down. A functional correspondence between natural deduction and the sequent calculus
• Inter-deriving semantic artifacts for object-oriented programming
• A formally verified compiler back-end
• Polynomial functors constrained by regular expressions
• Finiteness and rational sequences, constructively
• Comonadic notions of computation
• A generic functional representation of sorted trees supporting attribution (Haskell can do it)
• Incremental computing with abstract data structures
• Types as graphs: Continuations in type logical grammar
• On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation
• A monadic framework for delimited continuations
• Attribute grammars as recursion schemes over cyclic representations of zippers
• A static simulation of dynamic delimited control
• The zipper foldings of the diamond
• A proof-centric approach to mathematical assistants
• Deletion: The curse of the red-black tree
• The locally nameless representation
• An optimal, purely functional implementation of the Garsia-Wachs algorithm
• Constructing language processors with algebra combinators
• Programming language semantics: It’s easy as 1,2,3
• The essence of ornaments
• Recognizing Strategies
• Zipping strategies and attribute grammars
• Partial bounding for recursive function synthesis
• A survey of strategies in rule-based program transformation systems
• Bottom-Up derivatives of tree expressions
• Idris, a general-purpose dependently typed programming language: Design and implementation
• Lambda calculus with algebraic simplification for reduction parallelisation: extended study
• A unified treatment of syntax with binders
• Indexed containers
• Lazy tree splitting
• Efficiently deciding \(\mu\)-calculus with converse over finite trees
• Interleaving strategies
• Backward type inference for XML queries
• Understanding and maintaining tactics graphically OR how we are learning that a diagram can be worth more than 10K LoC
• From reduction-based to reduction-free normalization
• The next 700 program transformers
• Minimalist Grammars and Minimalist Categorial Grammars: Toward Inclusion of Generated Languages
• Verification of the Schorr-Waite algorithm -- from trees to graphs
• Continuation passing style for effect handlers
• Doo bee doo bee doo
• Effect handlers via generalised continuations
• Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition
• A type- and scope-safe universe of syntaxes with binding: their semantics and proofs
• On graph rewriting, reduction, and evaluation in the presence of cycles

This page was built for publication: The Zipper

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376491)