Fully effective solutions of recursive domain equations
This paper studies how we can exclude noncomputable elements of effectively given domains to obtain effective domains, and how we can obtain an effective domain which is an effectively initial solution to a recursive domain equation.
KeywordsRecursive Function Inverse Limit Effective Domain Total Indexing Characteristic Pair
Unable to display preview. Download preview PDF.
- Kanda, A, Data types as effective object, Theory of Computation Report No. 22, Warwick University, (1977).Google Scholar
- Kanda-Park, When two effectively given domains are identical, Proc. of the 4th GI Theoretical Computer Science Conference, Lecture Notes in Computer Science No. 67, (1979).Google Scholar
- Lehmann-Smyth, Data Types, Proc. of the 18th IEEE FOCS Conference, (1977).Google Scholar
- Scott-Strachey, Towards a mathematical semantics of computer languages, Proc. of Symposium on Computer and Automata, Polytechnical Inst. of Brooklyn (1971).Google Scholar
- Scott D., Data types as lattices, Unpublished lecture notes, Amsterdam, (1972).Google Scholar
- Scott D., Data types as lattices, SIAM J. on Computing, Vol. 5, (1976).Google Scholar
- Smyth-Plotkin, The categorical solution of recursive domain equations, Proc. of the 18th IEEE FOCS Conference, (1977).Google Scholar
- Tennent R., The denotational semantics of programming languages, CACM, Vol. 19, No. 18, (1977).Google Scholar
- Egli-Constable, Computability concepts for programming language semantics, Theoretical Computer Science, Vol. 2, (1976).Google Scholar
- Rosen-Markowsky, Bases for chain complete posets, IBM J. of R&D, Vol. 5, No. 3, (1976).Google Scholar
- Smyth M., Effectively given domains, Theoretical Computer Science, Vol. 5, (1977).Google Scholar