Kan Extensions for Program Optimisation Or: Art and Dan Explain an Old Trick-Reference-Cited by-同舟云学术

Kan Extensions for Program Optimisation Or: Art and Dan Explain an Old Trick

Published:2012 Issue: Volume: Page:324-362
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Hinze Ralf

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-31113-0_16.pdf

Reference35 articles.

1. Awodey, S.: Category Theory, 2nd edn. Oxford University Press (2010)

2. Backhouse, R., Bijsterveld, M., van Geldrop, R., van der Woude, J.: Category theory as coherently constructive lattice theory (1994), http://www.cs.nott.ac.uk/~rcb/MPC/CatTheory.ps.gz

3. Bird, R., de Moor, O.: Algebra of Programming. Prentice Hall Europe, London (1997)

4. Bird, R., Paterson, R.: Generalised folds for nested datatypes. Formal Aspects of Computing 11(2), 200–222 (1999)

5. Böhm, C., Berarducci, A.: Automatic synthesis of typed λ-programs on term algebras. Theoretical Computer Science 39(2-3), 135–154 (1985)

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A framework for higher-order effects & handlers;Science of Computer Programming;2024-05

2. Forward- or reverse-mode automatic differentiation: What's the difference?;Science of Computer Programming;2024-01

3. Calculating Compilers for Concurrency;Proceedings of the ACM on Programming Languages;2023-08-30

4. Modular Models of Monoids with Operations;Proceedings of the ACM on Programming Languages;2023-08-30

5. Disjunctive Delimited Control;Theory and Practice of Logic Programming;2023-04-11