Miranda: a non-strict functional language with polymorphic types
Proc. of a conference on Functional programming languages and computer architecture
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Logic and computation: interactive proof with Cambridge LCF
Logic and computation: interactive proof with Cambridge LCF
Proofs and types
About primitive recursive algorithms
Selected papers of the 16th international colloquium on Automata, languages, and programming
An introduction to functional programming
An introduction to functional programming
A gentle introduction to Haskell
ACM SIGPLAN Notices - Haskell special issue
Report on the programming language Haskell: a non-strict, purely functional language version 1.2
ACM SIGPLAN Notices - Haskell special issue
On the asymptotic behaviour of primitive recursive algorithms
Theoretical Computer Science
Decidability results for primitive recursive algorithms
Theoretical Computer Science
Interactive Computation: Stepping Stone in the Pathway From Classical to Developmental Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
A Representation Theorem for Primitive Recursive Algorithms
Fundamenta Informaticae
| Hi-index | 0.01 |
Lazy natural numbers arise by lazy evaluation of the successor function. This work investigates fundamental mathematical properties of the domain L of lazy natural numbers, and presents applications to computability theory and functional programming. It is shown that certain functions on sets of natural numbers like cardinality-finding and emptyness-testing which are not continuous (or even monotonic) when sets are given by characteristic functions N⊥ → T are both continuous and computable when sets are given by characteristic functions L → T defined in an appropriate way. These functions are definable in λ calculus based functional programming languages provided some parallel features are available.