Filters








852,138 Hits in 7.3 sec

A characterization of F-complete type assignments

Mariangiola Dezani-Ciancaglini, Ines Margaria
<span title="">1986</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;
The aim of this paper is to investigate the soundness and completeness of the intersection type discipline (for terms of the (untyped)  ...  Acknowledgment We are very grateful to the referees for suggesting improvements in the exposition of this paper.  ...  The main result is the characterization of the type theories which induce F-complete type assignments (Theorem 2.9).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(86)90043-5">doi:10.1016/0304-3975(86)90043-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/px4teppuwnbsxbaqumzefgvspu">fatcat:px4teppuwnbsxbaqumzefgvspu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190307081627/https://core.ac.uk/download/pdf/82805964.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/2e/5a/2e5a08176459dcf75f892ef5332ae839a6ad2013.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(86)90043-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

A complete type inference algorithm for simple intersection types [chapter]

M. Coppo, P. Giannini
<span title="">1992</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;
The system, which has a notion of principal type, is a proper extension of the ML type system. A sound and complete type checking algorithm is presented and proved correct.  ...  In this paper we present a decidable restriction of the intersection type discipline, obtained by combining intersection and universal quantification over types.  ...  The type inference algorithm is complete, due to the existence of principal type schemes, [I-Iindley, 1969] and [Milner, 1978] which fully characterize the set of types assignable to each lWork partially  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-55251-0_6">doi:10.1007/3-540-55251-0_6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zlcpizpnubfgphkwznhn4cgzim">fatcat:zlcpizpnubfgphkwznhn4cgzim</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190225105125/http://pdfs.semanticscholar.org/618e/846b16e2015c331359c741f114f04a8184b6.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/61/8e/618e846b16e2015c331359c741f114f04a8184b6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-55251-0_6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 3937 of Mathematical Reviews Vol. , Issue 93g [page]

<span title="">1993</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;
We prove the soundness and complete- ness of our type assignment system with respect to this notion of type interpretation.  ...  Our type assignment system is proved to be sound and complete with respect to both these type interpretations.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1993-07_93g/page/3937" 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_1993-07_93g/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 750 of Mathematical Reviews Vol. , Issue 2004b [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;
(I- UDIN-MI; Udine); Alessi, F. (I- UDIN-MI; Udine) A complete characterization of complete intersection-type preorders. (English summary) ACM Trans. Comput. Log. 4 (2003), no. 1, 120-147.  ...  The authors give a characterization of those type preorders which yield complete intersection-type assignment systems for /-calculi 03 MATHEMATICAL LOGIC AND FOUNDATIONS 750 with respect to the canonical  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2004-02_2004b/page/750" 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-02_2004b/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Type theories, normal forms, and D∞-lambda-models

M. Coppo, M. Dezani-Ciancaglini, M. Zacchi
<span title="">1987</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;
ACKNOWLEDGMENTS We thank Roger Hindley and a referee for suggestions improving the final form of this paper. RECEIVED March 1984: ACCEPTED March 1985  ...  More generally we can give a complete characterization in terms of normalization properties of the terms having a type without occurrences of "A ."  ...  In the rest of this section we prove the completeness of type assignment for invariant type theories with respect to the term model of b-equality.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0890-5401(87)90042-3">doi:10.1016/0890-5401(87)90042-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2c5pfse4qngj5o2mglbieugizu">fatcat:2c5pfse4qngj5o2mglbieugizu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190309032646/https://core.ac.uk/download/pdf/82636215.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/32/69/32694de9edc28248271c0333c5fbe75ca4dc817a.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(87)90042-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum

Simone Dantas, Sylvain Gravier, Frédéric Maffray
<span title="">2004</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lx7dev2le5anbg6oarljwh7lie" style="color: black;">Discrete Applied Mathematics</a> </i> &nbsp;
We characterize the graphs G such that Ch(G) + Ch( G) = n + 1, where Ch(G) is the choice number (list-chromatic number) of G and n is its number of vertices. ?  ...  Acknowledgements We thank Celina M.H. de Figueiredo for discussions on list colorings and for her careful reading of a previous version of this paper.  ...  Assume now that H is a complete subgraph of G. If p is adjacent to all vertices in S ∪ S f then as before G is of type F 1 . Else, let x be a vertex of S ∪ S f not adjacent to p. We claim that g = 1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0166-218x(03)00377-9">doi:10.1016/s0166-218x(03)00377-9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ergi7mgz2vd6paqwvzhpomekba">fatcat:ergi7mgz2vd6paqwvzhpomekba</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190317004252/https://core.ac.uk/download/pdf/81979021.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/54/c4/54c41c59627107c81488f5c79c5e2be43430560a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0166-218x(03)00377-9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

A Complete Characterization of Complete Intersection-Type Theories [article]

M. Dezani-Ciancaglini, F. Honsell, F. Alessi
<span title="2000-11-23">2000</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We characterize those intersection-type theories which yield complete intersection-type assignment systems for lambda-calculi, with respect to the three canonical set-theoretical semantics for intersection-types  ...  Secondly, the characterizations are all given just in terms of simple closure conditions on the preorder relation on the types, rather than on the typing judgments themselves.  ...  Acknowledgments The authors are grateful to Yoko Motohama and to the referees of ITRS submission for their useful comments and suggestions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0011039v1">arXiv:cs/0011039v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jfdk5i7hkzf6phpjgtmthgow24">fatcat:jfdk5i7hkzf6phpjgtmthgow24</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-cs0011039/cs0011039.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> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3a/72/3a7208481e421b7daedcc3dd5164a5ba246b05b7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0011039v1" 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>

A complete characterization of complete intersection-type preorders

M. Dezani-Ciancaglini, F. Honsell, F. Alessi
<span title="2003-01-01">2003</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3kjjbv4edjbezl2w37ipy5lo5a" style="color: black;">ACM Transactions on Computational Logic</a> </i> &nbsp;
We characterize those type preorders which yield complete intersection-type assignment systems for λ-calculi, with respect to the three canonical set-theoretical semantics for intersection-types: the inference  ...  Secondly, the characterizations are all given just in terms of simple closure conditions on the preorder relation, ≤, on the types, rather than on the typing judgments themselves.  ...  In particular the present general definition of type preorder which  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/601775.601780">doi:10.1145/601775.601780</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dxoevmipzjcihje73ic4cpyuw4">fatcat:dxoevmipzjcihje73ic4cpyuw4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20050405212946/http://www.di.unito.it:80/~dezani/papers/tocl03.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/77/6f77e1f9f1e5860270763a08bc222f5cba7b7d55.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/601775.601780"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Complexity of Grammar Induction for Quantum Types

Antonin Delpeuch
<span title="2014-12-28">2014</span> <i title="Open Publishing Association"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qzezkwolyvf33pglm2jldjklca" style="color: black;">Electronic Proceedings in Theoretical Computer Science</a> </i> &nbsp;
We study the complexity of grammar induction, and show that for a variety of type systems, including pivotal and compact closed categories, the grammar induction problem is NP-complete.  ...  Most categorical models of meaning use a functor from the syntactic category to the semantic category.  ...  Special thanks go to Jamie Vicary who helped me a lot by supervising and reviewing my work.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.172.16">doi:10.4204/eptcs.172.16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gu6fzvndrzgs7flxtzhmtwst5m">fatcat:gu6fzvndrzgs7flxtzhmtwst5m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190224102123/http://pdfs.semanticscholar.org/5488/3875873a24d6a73dc0b06c762acc1547bc5f.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/54/88/54883875873a24d6a73dc0b06c762acc1547bc5f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.172.16"> <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>

Synchronization in a power-driven moving agent network

Huan Shi, Lei Wang, Hua-ping Dai, You-xian Sun
<span title="">2010</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dlb6tmf5cve7dphk62d6tkyuvy" style="color: black;">Physica A: Statistical Mechanics and its Applications</a> </i> &nbsp;
y , z) type-1 coupling; h(x) = (x, 0, 0) type-2 coupling Synchronization in Crystallized Networks A typical example is given here, where ẋ = f (x) is the R össler oscillator, ẋ = −[y + z], ẏ = x + ay  ...  , ż = b + z[x − c] h(x) = (x, y , z) type-1 coupling; h(x) = (x, 0, 0) type-2 coupling Synchronization in Crystallized Networks A typical example is given here, where ẋ = f (x) is the R össler oscillator  ...  A Power Driven Network Model The above rules seems to be similar to the one in [Phys. Rev. Lett. 2006 96 164102] . However, the basic ideas in these two strategies are quite different.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.physa.2010.03.042">doi:10.1016/j.physa.2010.03.042</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jvs55ppjjrda3lumjmg32ldsv4">fatcat:jvs55ppjjrda3lumjmg32ldsv4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808220856/http://image.sciencenet.cn/olddata/kexue.com.cn/upload/blog/file/2010/8/20108210631463778.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/02/cd/02cd09a72a1a6527fd542cbf49d30423caee4f8a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.physa.2010.03.042"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Page 6604 of Mathematical Reviews Vol. , Issue 92m [page]

<span title="">1992</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;
(F-PARIS6-C) Weak completeness of type assignment in A-calculus models: a generalization of Hindley’s result. Theoret. Comput. Sci. 87 (1991), no. 1, 203-208.  ...  This paper concerns the completeness problem in Curry’s type assignment and introduces a notion of “weak completeness”. J. Baeten and B. Boerboom [Indag.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1992-12_92m/page/6604" 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_1992-12_92m/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 6035 of Mathematical Reviews Vol. , Issue 88k [page]

<span title="">1988</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;
“The type theories which induce F-complete type assignments are characterized.  ...  , Mariangiola (I-TRIN); Margaria, Ines (I-TRIN) A characterization of F-complete type assignments.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1988-11_88k/page/6035" 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_1988-11_88k/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 1783 of Mathematical Reviews Vol. , Issue 85e [page]

<span title="">1985</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;
Coppo, Mario (I-TRIN-I) 85e:03029 Completeness of type assignment in continuous lambda models. Theoret. Comput. Sci. 29 (1984), no. 3, 309-324.  ...  In contrast, continuity has played no role at all in the published semantics for type-assignment systems (systems of rules for assigning types to untyped -terms).  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1985-05_85e/page/1783" 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_1985-05_85e/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Sorting with Team Formation [article]

Job Boerma, Aleh Tsyvinski, Alexander P. Zimin
<span title="2021-09-16">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The equilibrium assignment as well as wages and firm values are completely characterized in closed form.  ...  The equilibrium assignment is also necessarily characterized by product countermonotonicity, meaning that sorting is negative for each dimension of heterogeneity with the product of heterogeneity in the  ...  First, we show that an equilibrium assignment is sufficiently characterized by two types of assignment regions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2109.02730v2">arXiv:2109.02730v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cvnyt77mybeazmu6c5ebxitc2y">fatcat:cvnyt77mybeazmu6c5ebxitc2y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210921030629/https://arxiv.org/pdf/2109.02730v2.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/68/7c/687cac33de2c1ec1ae6e0edc5d7d69fea6fd757e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2109.02730v2" 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>

SN combinators and partial combinatory algebras [chapter]

Yohji Akama
<span title="">1998</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;
We then prove the soundness and completeness for the class of partial combinatory algebras. Let F be the class of non-empty lters which consist of types.  ...  We introduce an intersection typing system for combinatory logic, such that a term of combinatory logic is typeable i it is sn.  ...  Ogawa and the anonymous referees of this paper. The idea of the system is brewed through discussion with Toshihiko Kurata. However, only the author is responsible for the fault of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0052378">doi:10.1007/bfb0052378</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/m4j3zd3yqvfo5jjxr43zg7jcle">fatcat:m4j3zd3yqvfo5jjxr43zg7jcle</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190224161037/http://pdfs.semanticscholar.org/5a84/50bda0906100409d357187f9b71712f4d83e.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/5a/84/5a8450bda0906100409d357187f9b71712f4d83e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0052378"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 852,138 results