Functional programs as executable specifications
Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
Communicating sequential processes
Communicating sequential processes
Miranda: a non-strict functional language with polymorphic types
Proc. of a conference on Functional programming languages and computer architecture
A safe approach to parallel combinator reduction
Proc. of the European symposium on programming on ESOP 86
Inductive methods for proving properties of programs
Communications of the ACM
The Science of Programming
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
The semantics of lazy (and industrious) evaluation
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Proving the correctness of reactive systems using sized types
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A framework for the recursive definition of data structures
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Sized Types for Typing Eden Skeletons
IFL '02 Selected Papers from the 13th International Workshop on Implementation of Functional Languages
Theoretical Computer Science - Real numbers and computers
Constructive analysis, types and exact real numbers
Mathematical Structures in Computer Science
Inductive and Coinductive Components of Corecursive Functions in Coq
Electronic Notes in Theoretical Computer Science (ENTCS)
Data-Oblivious Stream Productivity
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Using Structural Recursion for Corecursion
Types for Proofs and Programs
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Complexity of Fractran and Productivity
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Productivity of stream definitions
Theoretical Computer Science
Upper bounds on stream I/O using semantic interpretations
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Global and local space properties of stream programs
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Proving the unique fixed-point principle correct: an adventure with category theory
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Formalising exact arithmetic in type theory
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Design and implementation of 812: A declarative data-parallel language
Computer Languages
Automatic Sequences and Zip-Specifications
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On the complexity of equivalence of specifications of infinite objects
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Productivity of stream definitions
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Wellfounded recursion with copatterns: a unified approach to termination and productivity
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
Several related notions of the productivity are presented for functional languages with lazy evaluation. The notion of productivity captures the idea of computability, of progress of infinite-list programs. If an infinite-list program is productive, then every element of the list can be computed in finite “time.” These notions are used to study recursive list definitions, that is, lists defined by l where l = fl. Sufficient conditions are given in terms of the function f that either guarantee the productivity of the list or its unproductivity. Furthermore, a calculus is developed that can be used in verifying that lists defined by l where l = f I are productive. The power and the usefulness of our theory are demonstrated by several nontrivial examples. Several observations are given in conclusion.