Filters








537,768 Hits in 4.6 sec

Structures for structural recursion

Paul Downen, Philip Johnson-Freyd, Zena M. Ariola
2015 Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming - ICFP 2015  
At its heart, this study is guided by duality: each structure for recursion has a dual form, giving perfectly symmetric pairs of equal and opposite data and co-data types for representing recursion in  ...  We investigate several structures which represent well-founded forms of recursion in programs.  ...  Acknowledgments We would like to thank the anonymous reviewers for their helpful feedback on improving this paper. Paul Downen and Zena M. Ariola have been supported by NSF grant CCF-1423617.  ... 
doi:10.1145/2784731.2784762 dblp:conf/icfp/DownenJA15 fatcat:4w6762o63jarlnrcqomsexbn3q

Structures for structural recursion

Paul Downen, Philip Johnson-Freyd, Zena M. Ariola
2015 SIGPLAN notices  
At its heart, this study is guided by duality: each structure for recursion has a dual form, giving perfectly symmetric pairs of equal and opposite data and co-data types for representing recursion in  ...  We investigate several structures which represent well-founded forms of recursion in programs.  ...  Acknowledgments We would like to thank the anonymous reviewers for their helpful feedback on improving this paper. Paul Downen and Zena M. Ariola have been supported by NSF grant CCF-1423617.  ... 
doi:10.1145/2858949.2784762 fatcat:e3twq6k6hrfq5i2yuqe7qhtps4

Enhancing locality for recursive traversals of recursive structures

Youngjoon Jo, Milind Kulkarni
2011 SIGPLAN notices  
such transformations for irregular programs, which operate over pointer-based data structures such as graphs, trees and lists.  ...  In this paper, we argue that, for a class of irregular applications we call traversal codes, there exists substantial data reuse and hence opportunity for locality exploitation.  ...  Acknowledgments The authors would like to thank Bruce Walter for providing the Raytracing benchmark code, and Sebastian Thees for providing the Lightcuts benchmark code.  ... 
doi:10.1145/2076021.2048104 fatcat:qaflx5pc7nbbtmhc3hurh2v2dq

Enhancing locality for recursive traversals of recursive structures

Youngjoon Jo, Milind Kulkarni
2011 Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications - OOPSLA '11  
such transformations for irregular programs, which operate over pointer-based data structures such as graphs, trees and lists.  ...  In this paper, we argue that, for a class of irregular applications we call traversal codes, there exists substantial data reuse and hence opportunity for locality exploitation.  ...  Acknowledgments The authors would like to thank Bruce Walter for providing the Raytracing benchmark code, and Sebastian Thees for providing the Lightcuts benchmark code.  ... 
doi:10.1145/2048066.2048104 dblp:conf/oopsla/JoK11 fatcat:6cudnrjtffbdfkcfc7w3s5iaee

Using Structural Recursion for Corecursion [article]

Yves Bertot, Ekaterina Komendantskaya (INRIA Sophia Antipolis)
2009 arXiv   pre-print
We use a correspondence between streams and functions over natural numbers to show that some classes of non-guarded definitions can be modelled through the encoding as structural recursive functions.  ...  In practice, this work extends the class of stream values that can be defined in a constructive type theory-based theorem prover with inductive and coinductive types, structural recursion and guarded corecursion  ...  the structurally recursive model.  ... 
arXiv:0903.3850v1 fatcat:yadyrfmzd5hgxkux5izbesrnyy

Recursive structures for standard ML

Claudio V. Russo
2001 Proceedings of the sixth ACM SIGPLAN international conference on Functional programming - ICFP '01  
In Standard ML, modular programs must have a strictly hierarchical structure: the dependency between modules can never be cyclic.  ...  In particular, definitions of mutually recursive Core types and values, that arise frequently in practice, can never span module boundaries.  ...  A binding of the type structure for t is added to the resulting structure S.  ... 
doi:10.1145/507643.507644 fatcat:edyq6f5jkfgwtjoc4trw3yvdui

Recursive structures for standard ML

Claudio V. Russo
2012 SIGPLAN notices  
In Standard ML, modular programs must have a strictly hierarchical structure: the dependency between modules can never be cyclic.  ...  In particular, definitions of mutually recursive Core types and values, that arise frequently in practice, can never span module boundaries.  ...  A binding of the type structure for t is added to the resulting structure S.  ... 
doi:10.1145/2442776.2442784 fatcat:t4u7vzhvtreyxfteuysolpdx5u

Recursive structures for standard ML

Claudio V. Russo
2001 SIGPLAN notices  
In Standard ML, modular programs must have a strictly hierarchical structure: the dependency between modules can never be cyclic.  ...  In particular, definitions of mutually recursive Core types and values, that arise frequently in practice, can never span module boundaries.  ...  A binding of the type structure for t is added to the resulting structure S.  ... 
doi:10.1145/507669.507644 fatcat:an4hqdomxzedhgyq53is4lpnkq

Using Structural Recursion for Corecursion [chapter]

Yves Bertot, Ekaterina Komendantskaya
2009 Lecture Notes in Computer Science  
We use a correspondence between streams and functions over natural numbers to show that some classes of non-guarded definitions can be modelled through the encoding as structural recursive functions.  ...  In practice, this work extends the class of stream values that can be defined in a constructive type theory-based theorem prover with inductive and coinductive types, structural recursion and guarded corecursion  ...  the structurally recursive model.  ... 
doi:10.1007/978-3-642-02444-3_14 fatcat:tnp3aedqvvb2lazy2fi72fxtgm

Recursive structures for standard ML

Claudio V. Russo
2001 Proceedings of the sixth ACM SIGPLAN international conference on Functional programming - ICFP '01  
In Standard ML, modular programs must have a strictly hierarchical structure: the dependency between modules can never be cyclic.  ...  In particular, definitions of mutually recursive Core types and values, that arise frequently in practice, can never span module boundaries.  ...  A binding of the type structure for t is added to the resulting structure S.  ... 
doi:10.1145/507635.507644 dblp:conf/icfp/Russo01 fatcat:z3npvfamifhudkg6zqqoomtzyy

Structural Function Inlining Technique for Structurally Recursive XML Queries [chapter]

Chang-Wong Park, Jun-Ki Min, Chin-Wan Chung
2002 VLDB '02: Proceedings of the 28th International Conference on Very Large Databases  
At present, it is difficult for XQuery to type and optimize structurally recursive queries because of polymorphic recursive functions involved in the queries.  ...  Structurally recursive XML queries are an important query class that follows the structure of XML data.  ...  Let the structural parameter be a parameter of any sequence type which is used for structural recursion.  ... 
doi:10.1016/b978-155860869-6/50016-0 dblp:conf/vldb/ParkMC02 fatcat:4uewkevcbvbfjp2erelsr7do6y

Structural recursion for querying ordered graphs

Soichiro Hidaka, Kazuyuki Asada, Zhenjiang Hu, Hiroyuki Kato, Keisuke Nakano
2013 SIGPLAN notices  
It is, however, a challenge to define structural recursions for graph data structures, the most ubiquitous sort of data in computing.  ...  Structural recursion, in the form of, for example, folds on lists and catamorphisms on algebraic data structures including trees, plays an important role in functional programming, by providing a systematic  ...  Scientific Research for Encouragement of Young Scientists (B) No. 23700047, and a Grant-in-Aid for Scientific Research (B) No. 22300012.  ... 
doi:10.1145/2544174.2500608 fatcat:blf5rnoqwfhpzg3x6fioui7ujy

Abstractions for recursive pointer data structures

Laurie J. Hendren, Joseph Hummell, Alexandru Nicolau
1992 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation - PLDI '92  
Our approach is based on a mechanism for the Abstract Description of Data Structures (ADDS), which makes explicit the important properties, such as dimensionalit y, of pointer data structures.  ...  In this paper we introduce a new approach that leads to improved analysis and transformation of programs with recursively-defined pointer data structures.  ...  This is a serious drawback since programs with recursively-defined data structures often use recursion as well.  ... 
doi:10.1145/143095.143138 dblp:conf/pldi/HendrenHN92 fatcat:dcszoooao5eshc7yn2rjaihyle

Structural recursion for querying ordered graphs

Soichiro Hidaka, Kazuyuki Asada, Zhenjiang Hu, Hiroyuki Kato, Keisuke Nakano
2013 Proceedings of the 18th ACM SIGPLAN international conference on Functional programming - ICFP '13  
It is, however, a challenge to define structural recursions for graph data structures, the most ubiquitous sort of data in computing.  ...  Structural recursion, in the form of, for example, folds on lists and catamorphisms on algebraic data structures including trees, plays an important role in functional programming, by providing a systematic  ...  Scientific Research for Encouragement of Young Scientists (B) No. 23700047, and a Grant-in-Aid for Scientific Research (B) No. 22300012.  ... 
doi:10.1145/2500365.2500608 dblp:conf/icfp/HidakaAHKN13 fatcat:2st3rc5cwbdrbfvjshm3c2ukle

Powerlist: a structure for parallel recursion

Jayadev Misra
1994 ACM Transactions on Programming Languages and Systems  
Many data parallel algorithms -Fast Fourier Transform, Batcher's sorting schemes and prefixsum -exhibit recursive structure.  ...  We propose a data structure, powerlist, that permits succinct descriptions of such algorithms, highlighting the roles of both parallelism and recursion.  ...  A data structure, powerlist, is proposed in this paper that highlights the role of both parallelism and recursion.  ... 
doi:10.1145/197320.197356 fatcat:sbnis4yqy5cjflvmgzfkpayrs4
« Previous Showing results 1 — 15 out of 537,768 results