Filters








81,776 Hits in 3.7 sec

Not every finite lattice is embeddable in the recursively enumerable degrees

A.H Lachlan, R.I Soare
<span title="">1980</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/37jjomjmvfhrzf3di2gjnrrfuu" style="color: black;">Advances in Mathematics</a> </i> &nbsp;
Thus one of Go, G', G2 is nonrecursive. Now we turn to the proof that Gi is recursive in both 0 and Ck. To this end, observe that there is a Gary recursive function rr with the following property.  ...  Clearly, the total functions enumerable in this sense are those of degree GO'.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0001-8708(80)90027-4">doi:10.1016/0001-8708(80)90027-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2vwdewhs2zf5hjsm4dfcasrhqa">fatcat:2vwdewhs2zf5hjsm4dfcasrhqa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190223075046/https://core.ac.uk/download/pdf/82582308.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/11/2c/112c8c3e444cb00be7df688c2063b9e157c513d0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0001-8708(80)90027-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Page 2446 of Mathematical Reviews Vol. , Issue 89E [page]

<span title="">1989</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
For a function f:w— a, let t(f) = {(x, y): f(x) = y}, where (, ) is a recursive pairing function on w. The total e-degrees are the e-degrees of the sets of the form t(f).  ...  It is also proved that in any language and deductive system with the deduction property but without the rule of substitution, any consistent, deductively closed, recursive set of sentences has a recursive  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1989-05_89e/page/2446" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1989-05_89e/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 603 of Mathematical Reviews Vol. , Issue 87b [page]

<span title="">1987</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
It is possible, for every recursive operator ®, to find an effectively total recursive function y,, defining the operator ® such that Py(2') 18 @ minimal fixed point for ©?  ...  of strictly partial recursive functions were larger.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1987-02_87b/page/603" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1987-02_87b/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Partial morphisms in categories of effective objects

Eugenio Moggi
<span title="">1988</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/joe2ngto45hbnl3pncnesnq344" style="color: black;">Information and Computation</a> </i> &nbsp;
We introduce partial function spaces, partial Cartesian closed categories and complete objects, motivate their introduction, and show some of their properties.  ...  the recursive topos.  ...  For instance, in the case of total recursive functions we do not have an effective numbering, as for the partial ones.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0890-5401(88)90010-7">doi:10.1016/0890-5401(88)90010-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/p5xrpfnqivbnlmi7bd3i5bwwcm">fatcat:p5xrpfnqivbnlmi7bd3i5bwwcm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190314182640/https://core.ac.uk/download/pdf/82313778.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/4b/fc/4bfc346c75beca3cb47be45be282d923c4c41c8e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0890-5401(88)90010-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Recursive embeddings of partial orderings

K. R. Apt
<span title="1977-04-01">1977</span> <i title="Canadian Mathematical Society"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/m5ds6a3cpng5df7duilz7mzivi" style="color: black;">Canadian Journal of Mathematics - Journal Canadien de Mathematiques</a> </i> &nbsp;
J is atomless thend can be embedded into f!J by a function which is recursive in ef, f!J. If d is also atomless, then there is an isomorphism from d into f!J which is recursive ind, f!J. 1.  ...  We prove that there exists an embedding of X intod which is recursive in X, S!I and which destroys all suprema and infima of X which can be destroyed.  ...  Fld (X) is recursive in a set X, so for some total injective function a(x), which is recursive in X, Fld (X) = {a(O), a(l), ... l.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4153/cjm-1977-038-5">doi:10.4153/cjm-1977-038-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/soxahlel4ncc7anmhubonf5u5m">fatcat:soxahlel4ncc7anmhubonf5u5m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720184901/https://ir.cwi.nl/pub/10263/10263D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f3/4e/f34e80c6e70ca935817917bd01b0d5c88d44e71c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4153/cjm-1977-038-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Algorithmic randomness and Ramsey properties of countable homogeneous structures [article]

Willem L. Fouché
<span title="2013-08-26">2013</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We study, in the context of algorithmic randomness, the closed amenable subgroups of the symmetric group S_∞ of a countable set.  ...  recursive function φ : ω → ω and some effective enumeration (T i ) of Z.  ...  We identify M with a subset of {0, 1} (N×N) = by identifying a total order < on N with the function ξ : (N × N) = → {0, 1} given by ξ(x, y) = 1 ⇔ x < y, x, y ∈ N.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1308.5506v1">arXiv:1308.5506v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xiezazy6l5grjgid35677eitbi">fatcat:xiezazy6l5grjgid35677eitbi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191015151126/https://arxiv.org/pdf/1308.5506v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f1/db/f1db69c7d3fdd2e8ffb551dd70ba842f7888e30b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1308.5506v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Page 5991 of Mathematical Reviews Vol. , Issue 2004h [page]

<span title="">2004</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Then since 2004h:06021 the decimal expansion of z is recursively obtainable, the lattice- ordered group D(z) is recursively defined (as the authors show), and thus can be embedded in a finitely generated  ...  The theorem of Higman referred to is that every finitely generated group with a recursively enumerable set of defining relations can be embedded in a finitely presented group, i.e., a finitely generated  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2004-08_2004h/page/5991" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_2004-08_2004h/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

SOME FUNDAMENTAL ISSUES CONCERNING DEGREES OF UNSOLVABILITY [chapter]

Stephen G. Simpson
<span title="">2008</span> <i title="WORLD SCIENTIFIC"> Computational Prospects of Infinity </i> &nbsp;
Let ω ω be the Baire space, i.e., the set of all total functions f : ω → ω.  ...  Let C be a uniformly recursively enumerable class of total recursive functions satisfying some mild closure conditions, as explained in [42, Section 10] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/9789812796554_0017">doi:10.1142/9789812796554_0017</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/p2ovjhh4lrefbabj4we22svqlq">fatcat:p2ovjhh4lrefbabj4we22svqlq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060222160203/http://www.math.psu.edu:80/simpson/papers/fund.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c1/91/c1910413652f2102218f4c5d432156d8883e06c1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/9789812796554_0017"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> worldscientific.com </button> </a>

Page 3676 of Mathematical Reviews Vol. , Issue 82i [page]

<span title="">1982</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
In ordinary model theory saturated models enjoy a number of existence, uniqueness, and embedding properties.  ...  For recursively saturated models such a characterization of the existence of an elementary embedding is possible, however, as Theorem 2.7 shows.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1982-09_82i/page/3676" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1982-09_82i/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

3. Syntactic recursion and iteration [chapter]

Fred Karlsson, Harry van der Hulst
<span title="2010-01-16">2010</span> <i title="De Gruyter Mouton"> Recursion and Human Language </i> &nbsp;
Properties of languages can be described by formal mechanisms without necessarily renouncing the ultimate functional motivation of the properties.  ...  This obligatory basic linearization of word classes, constituents, heads and dependents, grammatical functions etc. defines the co-occurrence and word-order properties of the grammatical elements and constructions  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1515/9783110219258.43">doi:10.1515/9783110219258.43</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2qfnvlqazrbxjmpb4n752itnyi">fatcat:2qfnvlqazrbxjmpb4n752itnyi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190717210831/http://www.ling.helsinki.fi:80/~fkarlsso/Syntactic_Recursion_and_Iteration.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c7/3d/c73dc3e30849e72f5465a681ad2bdb3878d0fcf5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1515/9783110219258.43"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> degruyter.com </button> </a>

Sublattices of the polynomial time degrees

Klaus Ambos-Spies
<span title="">1985</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fbkexx2qg5anljkxraobuswdq4" style="color: black;">Information and Control</a> </i> &nbsp;
We show that any countable distributive lattice can be embedded in any interval of polynomial time degrees. Furthermore the embeddings can be chosen to preserve the least or the greatest element.  ...  This holds for both polynomial time bounded many-one and Turing reducibilities, as well as for all of the common intermediate reducibilities.  ...  ACKNOWLEDGMENTS We would like to thank one of the anonymous referees of STACS 84 for his comments on a first draft of Ambos-Spies (1984) , which enabled us to simplify parts of the proof of the embedding  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(85)80020-6">doi:10.1016/s0019-9958(85)80020-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4zezw2qoerbs5fd4iit2wjt3xe">fatcat:4zezw2qoerbs5fd4iit2wjt3xe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190414153329/https://core.ac.uk/download/pdf/82794947.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c2/37/c237ed8f6983d9ac297368fc0f259f48dfce0985.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(85)80020-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Axiomatic domain theory in categories of partial maps

Daniele Turi
<span title="">1998</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hq6x4whtd5hhlhsxzculyeamey" style="color: black;">Science of Computer Programming</a> </i> &nbsp;
One desirable property for partial maps is that they be representable in terms of total ones.  ...  For instance, the category of sets and partial functions can be derived from the category of total functions by choosing the subcategory of injective functions as admissible domains.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0167-6423(98)90035-1">doi:10.1016/s0167-6423(98)90035-1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nifmbgz63zdbvkztrz4w72rski">fatcat:nifmbgz63zdbvkztrz4w72rski</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170928174418/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/6a8/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDE2NzY0MjM5ODkwMDM1MQ%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/48/03/480392b9284c53dd6ad5f982a93070268a96c966.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0167-6423(98)90035-1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Programs as partial graphs II: Recursion

Gunther Schmidt
<span title="">1981</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
generalized setting of systems of recursive flow diagram programs.  ...  Finally, Hitchcock-Park's theorem on derivatives is formulated in the general case of nondeterministic recursive flow diagram programs.  ...  The ith recursive program of a terminates (in the operational sense) if the ith nonrecursive program in the embedding is totally correct with respect to FN(:= &J the embedding of the precondition m), and  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(81)90068-2">doi:10.1016/0304-3975(81)90068-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jlzmknughbhrtmbiq6dmxbg5y4">fatcat:jlzmknughbhrtmbiq6dmxbg5y4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170924175016/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/195/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMzA0Mzk3NTgxOTAwNjgy.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7e/79/7e796778e9497cd592d77072311898d0c5eaf779.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(81)90068-2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

How to Compare the Power of Computational Models [chapter]

Udi Boker, Nachum Dershowitz
<span title="">2005</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
On the positive side, we prove that Turing machines and the recursive functions are "complete" models, in the sense that they are not susceptible to this anomaly, justifying the standard means of showing  ...  This work was carried out in partial fulfillment of the requirements for the Ph.D. degree of the first author.  ...  The recursive functions (Rec) and the partial recursive functions (PR) are complete w.r.t. embedding.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11494645_7">doi:10.1007/11494645_7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/b4olwo5yfjf65abxxsxl4o25mu">fatcat:b4olwo5yfjf65abxxsxl4o25mu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20080221163506/http://www.math.tau.ac.il/~nachumd/papers/ComputationalPower.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fb/d4/fbd4b8c1402dc7bf578278079138a897fff13a1e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11494645_7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A co-induction principle for recursively defined domains

Andrew M Pitts
<span title="">1994</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
This paper establishes a new property of predomains recursively defined using the cartesian product, disjoint union, partial function space and convex powerdomain constructors.  ...  The co-induction principle also provides an apparently useful tool for reasoning about equality of elements of recursively defined datatypes in (strict or lazy) higher-order functional programming languages  ...  It benefited from the comments of Samson Abramsky, Mike Fourman, Wesley Phoa, Gordon Plotkin, Steve Vickers (who suggested Example 2.6), the comments of an anonymous referee, and members of the CLICS club  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(94)90014-0">doi:10.1016/0304-3975(94)90014-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zwkapru4dngsnoumj5jtbwjzwy">fatcat:zwkapru4dngsnoumj5jtbwjzwy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171001182510/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/a84/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMzA0Mzk3NTk0OTAwMTQw.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6f/29/6f2928bed5c4dbea95fec136cfdb43cd3fcdc113.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(94)90014-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 81,776 results