Derivational Complexity Is an Invariant Cost Model-Reference-Cited by-同舟云学术

Derivational Complexity Is an Invariant Cost Model

Published:2010 Issue: Volume: Page:100-113
ISSN:0302-9743
Container-title:Foundational and Practical Aspects of Resource Analysis
language:
Short-container-title:

Author:

Dal Lago Ugo,Martini Simone

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-15331-0_7

Reference16 articles.

1. Asperti, A., Coppola, P., Martini, S.: Optimalduplication is not elementary recursive. Inf. Comput. 193(1), 21–56 (2004)

2. Asperti, A., Mairson, H.G.: Parallel beta reduction is not elementary recursive. Inf. Comput. 170(1), 49–80 (2001)

3. Lecture Notes in Computer Science;M. Avanzini,2008

4. Barendregt, H., Eekelen, M., Glauert, J., Kennaway, J., Plasmeijer, M., Sleep, M.: Term graph rewriting. In: de Bakker, J., Nijman, A., Treleaven, P. (eds.) Parallel Languages on PARLE: Parallel Architectures and Languages Europe, vol. II, pp. 141–158. Springer, Heidelberg (1986)

5. Barendsen, E.: Term graph rewriting. In: Bezem, T.M., Klop, J.W., de Vrijer, R. (eds.) Term Rewriting Systems, ch. 13, pp. 712–743. Cambridge Univ. Press, Cambridge (2003)

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

1. Implementing Open Call-by-Value;Fundamentals of Software Engineering;2017

2. The Negligible and Yet Subtle Cost of Pattern Matching;Programming Languages and Systems;2017

3. Characterizing polynomial time complexity of stream programs using interpretations;Theoretical Computer Science;2015-06

4. Complexity Analysis by Graph Rewriting;Functional and Logic Programming;2010

5. Complexity Invariance of Real Interpretations;Lecture Notes in Computer Science;2010