Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleSeptember 2024
Zipper quintic fractal interpolation function for curve fitting
International Journal of Computing Science and Mathematics (IJCSM), Volume 20, Issue 2Pages 118–131https://doi.org/10.1504/ijcsm.2024.140889In this paper, we introduce a class of novel C2 -zipper rational quintic fractal interpolation functions (Zipper-RQFIF) with variable scalings in the form of a rational type that has a quintic polynomial in the numerator and a quadratic polynomial in the ...
- research-articleApril 2020
Zippro: The Design and Implementation of An Interactive Zipper
CHI '20: Proceedings of the 2020 CHI Conference on Human Factors in Computing SystemsPages 1–13https://doi.org/10.1145/3313831.3376756Zippers are common in a wide variety of objects that we use daily. This work investigates how we can take advantage of such common daily activities to support seamless interaction with technology. We look beyond simple zipper-sliding interactions ...
- research-articleOctober 2018
The Design Evolution of the Zipper: A Patent Review
ICIBE '18: Proceedings of the 4th International Conference on Industrial and Business EngineeringPages 288–294https://doi.org/10.1145/3288155.3290586Cliff is a project which aims to develop an automatized zipper for the zipping and unzipping process. The focus of this study is to visualize the evolution trends of the zipper (slide fastener) since its first invention back in 1851 to 2017. The patent ...
- research-articleSeptember 2011
Monads, zippers and views: virtualizing the monad stack
ICFP '11: Proceedings of the 16th ACM SIGPLAN international conference on Functional programmingPages 32–44https://doi.org/10.1145/2034773.2034781We make monadic components more reusable and robust to changes by employing two new techniques for virtualizing the monad stack: the monad zipper and monad views. The monad zipper is a higher-order monad transformer that creates virtual monad stacks by ...
Also Published in:
ACM SIGPLAN Notices: Volume 46 Issue 9 - research-articleJanuary 2011
Calculating tree navigation with symmetric relational zipper
PEPM '11: Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulationPages 101–110https://doi.org/10.1145/1929501.1929521Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language that locates particular nodes in a given document structure.
This paper ...
- articleSeptember 2010
Strengthening the Zipper
Electronic Notes in Theoretical Computer Science (ENTCS) (ENTCS), Volume 253, Issue 7Pages 3–18https://doi.org/10.1016/j.entcs.2010.08.028The zipper is a well known design pattern for providing a cursor-like interface to a data structure. However, the classic treatise by Huet only scratches the surface of some of its potential applications. In this paper we take inspiration from Huet, and ...
- research-articleSeptember 2008
Clase: cursor library for a structured editor
Haskell '08: Proceedings of the first ACM SIGPLAN symposium on HaskellPages 123–124https://doi.org/10.1145/1411286.1411302The zipper is a well known design pattern for providing a cursor-like interface to a data structure. However, the classic treatise by Huet (1) only scratches the surface of some of the potential applications of the zipper. In this work we have taken ...
Also Published in:
ACM SIGPLAN Notices: Volume 44 Issue 2 - research-articleSeptember 2008
A functional implementation of the garsia--wachs algorithm: (functional pearl)
ML '08: Proceedings of the 2008 ACM SIGPLAN workshop on MLPages 91–96https://doi.org/10.1145/1411304.1411317This functional pearl proposes an ML implementation of the Garsia-Wachs algorithm. This somewhat obscure algorithm builds a binary tree with minimum weighted path length from weighted leaf nodes with given inorder. Our solution exhibits the usual ...
- ArticleApril 2008
Analysis of Zipper as a hash function
ISPEC'08: Proceedings of the 4th international conference on Information security practice and experiencePages 392–403At CRYPTO 2005, Coron etc. proposed several modified methods to make the usual hash functions based on MD method indifferentiable from random oracles. However, the compression functions used in Coron's schemes are supposed to be random oracles. This ...
- research-articleJanuary 2008
Clowns to the left of me, jokers to the right (pearl): dissecting data structures
POPL '08: Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languagesPages 287–295https://doi.org/10.1145/1328438.1328474This paper introduces a small but useful generalisation to the 'derivative' operation on datatypes underlying Huet's notion of 'zipper', giving a concrete representation to one-hole contexts in data which is undergoing transformation. This operator, '...
Also Published in:
ACM SIGPLAN Notices: Volume 43 Issue 1