Filters








345,079 Hits in 2.8 sec

Intersection type assignment systems

Steffen van Bakel
<span title="">1995</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;
It presents the essential intersection type assignment system, that will prove to be as powerful as the well-known BCDsystem.  ...  This paper gives an overview of intersection type assignment for the Lambda Calculus, as well as compares in detail variants that have been defined in the past.  ...  The first was the Rank 2 intersection type assignment system [2] , as first suggested by Leivant in [26] , that is very close to the notion of type assignment as used in ML.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(95)00073-6">doi:10.1016/0304-3975(95)00073-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/exra2row3vesrd2tof6w6znhrm">fatcat:exra2row3vesrd2tof6w6znhrm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171004073603/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/db4/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMzA0Mzk3NTk1MDAwNzM2.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/09/fb/09fb31de7e18bd02e5c4aaa991b4aaef0b55dc41.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(95)00073-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Innocent Game Semantics via Intersection Type Assignment Systems

Pietro Di Gianantonio, Marina Lenisa, Marc Herbstritt
<span title="2013-08-27">2013</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/kjskj3qctjdkbigtx4fkcqiyii" style="color: black;">Annual Conference for Computer Science Logic</a> </i> &nbsp;
The aim of this work is to correlate two different approaches to the semantics of programming languages: game semantics and intersection type assignment systems (ITAS).  ...  Namely, we present an ITAS that provides the description of the semantic interpretation of a typed lambda calculus in a game model based on innocent strategies.  ...  in the intersection type assignment system.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.csl.2013.231">doi:10.4230/lipics.csl.2013.231</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/csl/GianantonioL13.html">dblp:conf/csl/GianantonioL13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4tpu7d367badrahty7mls4p63i">fatcat:4tpu7d367badrahty7mls4p63i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809081602/http://users.dimi.uniud.it/~pietro.digianantonio/papers/copy_pdf/innocent_itas.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/07/56/075618341c1df2db4e1ea866ef8c36c2f96dc9c4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.csl.2013.231"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Completeness of type assignment systems with intersection, union, and type quantifiers

Hirofumi Yokouchi
<span title="">2002</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 develops type assignment systems with intersection and union types, and type quantiÿers. We show that the known system for these types is not semantically complete.  ...  models is equivalent to that for standard models, (2) if we add two axioms expressing the distributive laws of intersection over union and existential-type quantiÿer, then the resulting system is complete  ...  It is known that the rule (Eq ÿ ) is admissible in the intersection-type assignment system with the !-type [14] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(00)00356-x">doi:10.1016/s0304-3975(00)00356-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/z23tji5kl5gxposku4cjyzdcom">fatcat:z23tji5kl5gxposku4cjyzdcom</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171004084439/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/dc3/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDMwNDM5NzUwMDAwMzU2eA%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/82/65/826502ea12d4ebc2bea609e26e7d14b1ac1e7039.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(00)00356-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Partial intersection type assignment in applicative term rewriting systems [chapter]

Steffen van Bakel
<span title="">1993</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;
This paper introduces a notion of partial type assignment on applicative term rewriting systems that is based on a combination of an essential intersection type assignment system, and the type assignment  ...  Terms and rewrite rules will be written as trees, and type assignment will consists of assigning intersection types function symbols, and specifying the way in which types can be assigned to nodes and  ...  In [9, 6] the intersection type discipline for the lambda calculus is presented, an extension of Curry's type assignment system.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0037096">doi:10.1007/bfb0037096</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5jkblcsaibcvrjvnsjqm2ybkxi">fatcat:5jkblcsaibcvrjvnsjqm2ybkxi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20080221164905/http://www.doc.ic.ac.uk/~svb/Research/Papers/TLCA93.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/de/63/de63841b0bb3081d222f32d5bf3d7bb47fb02365.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0037096"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Intersection type assignment systems with higher-order algebraic rewriting

Franco Barbanera, Maribel Fernández
<span title="">1996</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;
A powerful type assignment system, the one based on intersection types, is extended with first-and higherorder algebraic rewriting, and relevant properties, like strong normalization and completeness,  ...  In the present paper this subject is addressed from the point of view of fype assignment.  ...  Appendix: Combining many-sorted rewrite systems with I-"  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(96)80706-7">doi:10.1016/s0304-3975(96)80706-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cc264xkqhnfrjkt5sby3hn67ii">fatcat:cc264xkqhnfrjkt5sby3hn67ii</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190419193047/https://core.ac.uk/download/pdf/81951514.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/ff/6f/ff6f59c28c57525a6dc17841f4e7f8d797fe8e84.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(96)80706-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Polymorphic Intersection Type Assignment for Rewrite Systems with Abstraction and β-Rule [chapter]

Steffen van Bakel, Franco Barbanera, Maribel Fernández
<span title="">2000</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 types used in these systems are a combination of ( -free) intersection and polymorphic types.  ...  For this system we define, using an extended notion of unification, a notion of principal type, and show that type assignment is decidable.  ...  A Polymorphic Intersection System for TRS We define a type assignment system for TRS , that can be seen as an extension (by adding ) of the intersection system presented in [5] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-44557-9_3">doi:10.1007/3-540-44557-9_3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fweecy2czbbkzgk4b7r4vdpcey">fatcat:fweecy2czbbkzgk4b7r4vdpcey</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829145248/http://www.doc.ic.ac.uk/~svb/Research/Papers/Types.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/77/8a/778a1454ac0f0acb7d85958ebc464f55f39e21c6.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-44557-9_3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Cut-Elimination in the Strict Intersection Type Assignment System is Strongly Normalizing

Steffen van Bakel
<span title="">2004</span> <i title="Duke University Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/un57kpou5jawnm7yjqoeumbno4" style="color: black;">Notre Dame Journal of Formal Logic</a> </i> &nbsp;
This paper defines reduction on derivations (cut-elimination) in the Strict Intersection Type Assignment System of [1] and shows a strong normalisation result for this reduction.  ...  Using this result, new proofs are given for the approximation theorem and the characterisation of normalisability of terms, using intersection types.  ...  The kind of intersection type assignment considered in this paper is that of [1] , i.e. the strict intersection type assignment system, a restricted version of the BCD-system of [10] , that is equally  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1305/ndjfl/1094155278">doi:10.1305/ndjfl/1094155278</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vt67d3sn5rawhhr3jalhntkgdy">fatcat:vt67d3sn5rawhhr3jalhntkgdy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190225213339/http://pdfs.semanticscholar.org/74b5/13829117fb5577b5ebbcedf38a659d797024.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/74/b5/74b513829117fb5577b5ebbcedf38a659d797024.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1305/ndjfl/1094155278"> <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>

Completeness of intersection and union type assignment systems for call-by-value λ-models

Hajime Ishihara, Toshihiko Kurata
<span title="">2002</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;
We study a version of intersection and union-type assignment system, union elimination rule of which is allowed only when subject of its major premiss is a value of call-by-value -calculus.  ...  The system is shown to be sound and complete under some abstract notion of membership relation deÿned over simple semantics for call-by-value -models, and to be invariant under call-by-value ÿ-conversion  ...  See [9, 18, 23] for other extensions of the intersection-type assignment system.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(00)00351-0">doi:10.1016/s0304-3975(00)00351-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mfmihubar5aa7kg5hk3q6nygx4">fatcat:mfmihubar5aa7kg5hk3q6nygx4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171001215834/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/ab3/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDMwNDM5NzUwMDAwMzUxMA%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/12/42/1242fa026336f7f262e0bdec8169f169548ad8e7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(00)00351-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Innocent Game Semantics via Intersection Type Assignment Systems *

Pietro Gianantonio, Marina Lenisa
<span class="release-stage">unpublished</span>
The aim of this work is to correlate two different approaches to the semantics of programming languages: game semantics and intersection type assignment systems (ITAS).  ...  Namely, we present an ITAS that provides the description of the semantic interpretation of a typed lambda calculus in a game model based on innocent strategies.  ...  in the intersection type assignment system.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ggwwp6rpenapnik2kvemon4stq">fatcat:ggwwp6rpenapnik2kvemon4stq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180513080722/http://drops.dagstuhl.de/opus/volltexte/2013/4200/pdf/20.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/12/aa/12aa5b9b14a830ded831c9dc6fae0afd7d9c4b85.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Towards an Intersection Typed System à la Church

Luigi Liquori, Simona Ronchi della Rocca
<span title="">2005</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uy5mv2ncw5eahkdx47hkrglxmm" style="color: black;">Electronical Notes in Theoretical Computer Science</a> </i> &nbsp;
à la Church of the type assignment system as invented by Coppo and Dezani.  ...  In this paper, we presents a comfortable fully typed lambda calculus based on the well-known intersection type system discipline where proof are not only feasible but easy; the present system is the counterpart  ...  Introduction The Intersection Type Assignment System (Λ u ∧) is a set of inference rules for assigning Intersection types to terms of the untyped λ-calculus.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2005.06.015">doi:10.1016/j.entcs.2005.06.015</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pwwhiynibzfiblblfzx55ys66m">fatcat:pwwhiynibzfiblblfzx55ys66m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170812093049/http://www.di.unito.it/~ronchi/papers/itrs-liquori-ronchi.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/78/f1788285cda0202e58f670086c5d29485b9d3dd1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2005.06.015"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></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.  ...  In this paper we introduce a type assignment system based on a combination of the notions of rank two polymorphism and intersection.  ... 
<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>

Reduction in X does not agree with Intersection and Union Types (Extended abstract) [article]

Steffen van Bakel
<span title="2011-09-21">2011</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This paper defines intersection and union type assignment for the calculus X, a substitution free language that enjoys the Curry-Howard correspondence with respect to Gentzen's sequent calculus for classical  ...  Intersection Type Assignment for the Lambda Calculus The notion of intersection type assignment for X as defined in the next section is a conservative extension of the Intersection Type Assignment System  ...  Witness expansion and reduction One of the main properties of the intersection type assignment system is the perseverance of types under both subject reduction and subject expansion.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1109.4570v1">arXiv:1109.4570v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/o7x3eehvpbbnblizryh5pav7i4">fatcat:o7x3eehvpbbnblizryh5pav7i4</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1109.4570/1109.4570.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] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1109.4570v1" 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>

Intersection Types and Computational Rules

Fabio Alessi, Franco Barbanera, Mariangiola Dezani-Ciancaglini
<span title="">2003</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uy5mv2ncw5eahkdx47hkrglxmm" style="color: black;">Electronical Notes in Theoretical Computer Science</a> </i> &nbsp;
results for intersection type systems enabling typing invariance of terms w.r.t. various notions of reduction/expansion, like ¬, and a number of relevant restrictions of theirs.  ...  Being the intersection type systems a general framework for the study of semantic domains for the Lambdacalculus, the present paper provides a characterisation of "meaning invariance" in terms of characterisation  ...  Definition 2.5 [Eta Intersection Type Assignments We are now ready to introduce the crucial notion of intersection type assignment system. First we need a few preliminary definitions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1571-0661(04)80843-0">doi:10.1016/s1571-0661(04)80843-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ir3idq4yancmndvhaw5r6auuda">fatcat:ir3idq4yancmndvhaw5r6auuda</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190220024741/https://core.ac.uk/download/pdf/82773709.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/09/5e/095ebff6182af652ecd0f1f39fda5c56322c8c72.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1571-0661(04)80843-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

The Delta-calculus: Syntax and Types

Luigi Liquori, Claude Stolze, Michael Wagner
<span title="2019-06-21">2019</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wkjtc7dggzfktmoov66odshrra" style="color: black;">International Conference on Rewriting Techniques and Applications</a> </i> &nbsp;
the relations between intersection type assignment systems à la Curry and the corresponding intersection typed systems à la Church.  ...  We state the relationship between the intersection type assignment systems à la Curry and the corresponding intersection typed systems à la Church by means of an essence function translating an explicitly  ...  The set of atoms, intersection types, intersection type theories and intersection type assignment systems are defined as follows: 1. (Atoms).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.fscd.2019.28">doi:10.4230/lipics.fscd.2019.28</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/rta/LiquoriS19.html">dblp:conf/rta/LiquoriS19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mjhdl53epbe65kc3ibkahzlpim">fatcat:mjhdl53epbe65kc3ibkahzlpim</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200303082744/https://drops.dagstuhl.de/opus/volltexte/2019/10535/pdf/LIPIcs-FSCD-2019-28.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/51/63/5163cb40f17c9e0549361a9ada02751f705ec1c3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.fscd.2019.28"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Intersection Types and Denotational Semantics: An Extended Abstract (Invited Paper)

Simona Ronchi Della Rocca, Michael Wagner
<span title="2018-10-24">2018</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/bg7eff2ccngt5gat6bipkw45b4" style="color: black;">Types for Proofs and Programs</a> </i> &nbsp;
This is a short survey of the use of intersection types for reasoning in a finitary way about terms interpretations in various models of lambda-calculus.  ...  assignment system.  ...  assignment system. coherence space.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.types.2016.2">doi:10.4230/lipics.types.2016.2</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/types/Rocca16.html">dblp:conf/types/Rocca16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5upgqtwghncmbkxvmoypq5cgm4">fatcat:5upgqtwghncmbkxvmoypq5cgm4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220121002306/https://drops.dagstuhl.de/opus/volltexte/2018/9861/pdf/LIPIcs-TYPES-2016-2.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/9c/c5/9cc5379efecdb7b3536c562d7f192c467fce145d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.types.2016.2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 345,079 results