Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Guest editorial: Special issue on implicit computational complexity

Guest editorial: Special issue on implicit computational complexity Guest Editorial: Special Issue on Implicit Computational Complexity This special issue of ACM Transactions on Computational Logic is devoted to implicit computational complexity, following the Workshop on Implicit Computational Complexity held in Marseilles in February 2006 as part of the special thematic session on Geometry of Computation (GEOCAL ™06) at the Centre International de Rencontres Math matiques. The articles selected were submitted e responding to a public call-for-papers after the workshop and have undergone the TOCL standard refereeing process. The area of Implicit Computational Complexity (ICC) has emerged from various propositions to use logic and formal methods to provide languages for complexity-bounded computation. It aims at studying the computational complexity of programs without referring to a particular machine model, external measuring conditions, or particular interpretations, only considering language restrictions or logical/ computational principles entailing complexity properties. Several approaches have been explored for this purpose such as restrictions on primitive recursion and rami cation, rewriting systems, linear logic, types and lambda-calculus. They originally often relied on the functional programming paradigm. ICC ™s two main objectives are: (1) to nd natural implicit logical characterizations of functions of various complexity classes, and (2) to design systems suitable for static veri cation http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Computational Logic (TOCL) Association for Computing Machinery

Guest editorial: Special issue on implicit computational complexity

Download PDF
2 pages

Loading next page...
 
/lp/association-for-computing-machinery/guest-editorial-special-issue-on-implicit-computational-complexity-akYo3UrzVg

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2009 by ACM Inc.
ISSN
1529-3785
DOI
10.1145/1555746.1555747
Publisher site
See Article on Publisher Site

Abstract

Guest Editorial: Special Issue on Implicit Computational Complexity This special issue of ACM Transactions on Computational Logic is devoted to implicit computational complexity, following the Workshop on Implicit Computational Complexity held in Marseilles in February 2006 as part of the special thematic session on Geometry of Computation (GEOCAL ™06) at the Centre International de Rencontres Math matiques. The articles selected were submitted e responding to a public call-for-papers after the workshop and have undergone the TOCL standard refereeing process. The area of Implicit Computational Complexity (ICC) has emerged from various propositions to use logic and formal methods to provide languages for complexity-bounded computation. It aims at studying the computational complexity of programs without referring to a particular machine model, external measuring conditions, or particular interpretations, only considering language restrictions or logical/ computational principles entailing complexity properties. Several approaches have been explored for this purpose such as restrictions on primitive recursion and rami cation, rewriting systems, linear logic, types and lambda-calculus. They originally often relied on the functional programming paradigm. ICC ™s two main objectives are: (1) to nd natural implicit logical characterizations of functions of various complexity classes, and (2) to design systems suitable for static veri cation

Journal

ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery

Published: Aug 1, 2009

There are no references for this article.