A generic imperative language for polynomial time
সংরক্ষণ করুন:
| প্রকাশিত: | arXiv.org (Feb 19, 2020), p. n/a |
|---|---|
| প্রধান লেখক: | |
| প্রকাশিত: |
Cornell University Library, arXiv.org
|
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | Citation/Abstract Full text outside of ProQuest |
| ট্যাগগুলো: |
কোনো ট্যাগ নেই, প্রথমজন হিসাবে ট্যাগ করুন!
|
| সার সংক্ষেপ: | The ramification method in Implicit Computational Complexity has been associated with functional programming, but adapting it to generic imperative programming is highly desirable, given the wider algorithmic applicability of imperative programming. We introduce a new approach to ramification which, among other benefits, adapts readily to fully general imperative programming. The novelty is in ramifying finite second-order objects, namely finite structures, rather than ramifying elements of free algebras. In so doing we bridge between Implicit Complexity's type theoretic characterizations of feasibility, and the data-flow approach of Static Analysis. |
|---|---|
| আইএসএসএন: | 2331-8422 |
| সম্পদ: | Engineering Database |