Filters








769 Hits in 4.7 sec

Page 527 of Mathematical Reviews Vol. , Issue 2002A [page]

<span title="">2002</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;
, ON Some contributions to the metatheory of the situation calculus.  ...  The four main contributions of the paper to the meta-theory of situa- tion calculus axiomatizations of dynamical systems are considered to be the following: (a) The proposed axiomatization for actions  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2002-01_2002a/page/527" 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_2002-01_2002a/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

The Potential and the Pitfalls of Metatheory in IR

Lucas Grassi Freire
<span title="">2013</span> <i title="Pontifícia Universidade Católica de Minas Gerais"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zqn3hkrkjbgvdlt6ndgwwb7r54" style="color: black;">Estudos Internacionais Revista de Relações Internacionais da PUC Minas</a> </i> &nbsp;
'Mild' claims, on the other hand, acknowledge to some extent the potential of metatheory in IR, whilst pointing out contingent problems in its current form.  ...  Nevertheless, some of the claims against metatheory in IR contradict themselves.  ...  Because it opens up this kind of space, metatheory is seen as providing a positive contribution to the eld.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://doaj.org/article/971310aa62ec48feb8942ae3084e5b97">doaj:971310aa62ec48feb8942ae3084e5b97</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6ltfzphyxzcmtgvsgz5z3szxky">fatcat:6ltfzphyxzcmtgvsgz5z3szxky</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200319212939/http://periodicos.pucminas.br/index.php/estudosinternacionais/article/download/6317/5796" 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/a8/a6/a8a6fad99149aad8afa80875a2508f8092da1146.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Mechanized Metatheory Revisited

Dale Miller
<span title="2018-10-04">2018</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2ewief65xnegfh2slwulpgsnba" style="color: black;">Journal of automated reasoning</a> </i> &nbsp;
In particular, the combination of Church's approach to terms and formulas (found in his Simple Theory of Types) and Gentzen's approach to proofs (found in his sequent calculus) yields a framework for the  ...  When proof assistants and theorem provers implement the metatheory of logical systems, they must deal with a range of syntactic expressions (e.g., types, formulas, and proofs) that involve variable bindings  ...  I thank Gopalan Nadathur and the anonymous reviewers for their many helpful comments on an earlier draft of this paper. This work was funded in part by the ERC Advanced Grant ProofCert.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10817-018-9483-3">doi:10.1007/s10817-018-9483-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sgmm2r4hn5ab3mgpvvzwhcjs5i">fatcat:sgmm2r4hn5ab3mgpvvzwhcjs5i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190426112714/https://hal.inria.fr/hal-01884210/document" 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/ef/62/ef620fb93bc569480b8060737cd3801f7b09cdc0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10817-018-9483-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Formalizing the metatheory of logical calculi and automatic provers in Isabelle/HOL (invited talk)

Jasmin Christian Blanchette
<span title="">2019</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/v2jnxq36qfdxhby7zfh6sfsc4e" style="color: black;">Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2019</a> </i> &nbsp;
At the heart of the project is the conviction that proof assistants have become mature enough to actually help researchers in automated reasoning when they develop new calculi and tools.  ...  In this paper, I describe and reflect on three verification subprojects to which I contributed: a first-order resolution prover, an imperative SAT solver, and generalized term orders for λ-free higher-order  ...  The IsaFoL (Isabelle Formalization of Logic) effort 1 aims at changing this situation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3293880.3294087">doi:10.1145/3293880.3294087</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/cpp/Blanchette19.html">dblp:conf/cpp/Blanchette19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n7delklh2nejvh4zspbcljamwy">fatcat:n7delklh2nejvh4zspbcljamwy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200509083001/https://hal.archives-ouvertes.fr/hal-01937136/document" 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/ca/be/cabef529ca9ce675c4b504687ba7d6165d7690c3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3293880.3294087"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Access control in a core calculus of dependency

Martín Abadi
<span title="2006-09-16">2006</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xu5bk2lj5rbdxlx6222nw7tsxi" style="color: black;">SIGPLAN notices</a> </i> &nbsp;
The Dependency Core Calculus (DCC) is an extension of the computational lambda calculus that was designed in order to capture the notion of dependency that arises in informationflow control, partial evaluation  ...  Initiating the study of DCC from this perspective, we explore some of its appealing properties.  ...  Metatheory In this section we start to explore the metatheory of Polymorphic DCC.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1160074.1159839">doi:10.1145/1160074.1159839</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/m4l3d2nktrfbpfmaehdmycm3um">fatcat:m4l3d2nktrfbpfmaehdmycm3um</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922235138/https://www.brinckerhoff.org/clements/csc530-sp08/Readings/abadi-2006.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/ae/b7/aeb7361c312acc71fe7fdb295a68a76d37197b47.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1160074.1159839"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Access control in a core calculus of dependency

Martín Abadi
<span title="">2006</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ug3n3jfg4jdcpdvbrhe3m4txqa" style="color: black;">Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming - ICFP &#39;06</a> </i> &nbsp;
The Dependency Core Calculus (DCC) is an extension of the computational lambda calculus that was designed in order to capture the notion of dependency that arises in informationflow control, partial evaluation  ...  Initiating the study of DCC from this perspective, we explore some of its appealing properties.  ...  Metatheory In this section we start to explore the metatheory of Polymorphic DCC.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1159803.1159839">doi:10.1145/1159803.1159839</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icfp/Abadi06.html">dblp:conf/icfp/Abadi06</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/in3ibctyxzct3lpvu3s5se3asq">fatcat:in3ibctyxzct3lpvu3s5se3asq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922235138/https://www.brinckerhoff.org/clements/csc530-sp08/Readings/abadi-2006.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/ae/b7/aeb7361c312acc71fe7fdb295a68a76d37197b47.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1159803.1159839"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Access Control in a Core Calculus of Dependency

Martín Abadi
<span title="">2007</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;
The Dependency Core Calculus (DCC) is an extension of the computational lambda calculus that was designed in order to capture the notion of dependency that arises in informationflow control, partial evaluation  ...  Initiating the study of DCC from this perspective, we explore some of its appealing properties.  ...  Metatheory In this section we start to explore the metatheory of Polymorphic DCC.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2007.02.002">doi:10.1016/j.entcs.2007.02.002</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cdshnmrjt5fjrgvtb75iiwk2ky">fatcat:cdshnmrjt5fjrgvtb75iiwk2ky</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922235138/https://www.brinckerhoff.org/clements/csc530-sp08/Readings/abadi-2006.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/ae/b7/aeb7361c312acc71fe7fdb295a68a76d37197b47.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.2007.02.002"> <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>

Coq Coq correct! verification of type checking and erasure for Coq, in Coq

Matthieu Sozeau, Simon Boulier, Yannick Forster, Nicolas Tabareau, Théo Winterhalter
<span title="2019-12-20">2019</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dqy7qc7jkzal5bz3gueys3siz4" style="color: black;">Proceedings of the ACM on Programming Languages (PACMPL)</a> </i> &nbsp;
and axiomatisation of part of its metatheory.  ...  Although the metatheory of CIC is very stable and reliable, the correctness of its implementation in Coq is less clear.  ...  Metatheory The previous section specifies the theory of PCUIC. To implement a type checker for PCUIC and prove it correct, we actually need to formalise also some parts of its metatheory.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3371076">doi:10.1145/3371076</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sdm7suzouzexpdey3o4o5wzkce">fatcat:sdm7suzouzexpdey3o4o5wzkce</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210429013225/https://hal.archives-ouvertes.fr/hal-02380196v2/file/popl20main-p34-p-79d1b9f-43140-final.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/c3/32/c332154b90d7e1d9ed86a00d0a4c98391d21c7fc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3371076"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Linear Logic, the π-calculus, and their Metatheory: A Recipe for Proofs as Processes [article]

Fabrizio Montesi, Marco Peressotti
<span title="2021-06-22">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
What remains is reconstructing the expected metatheory of session types and the π-calculus.  ...  Initiated by Abramsky [1994], the Proofs as Processes agenda is to establish a solid foundation for the study of concurrent languages, by researching the connection between linear logic and the π-calculus  ...  ACKNOWLEDGMENTS The authors thank Luís Cruz-Filipe and Davide Sangiorgi for useful discussions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2106.11818v1">arXiv:2106.11818v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yezqvwkjbjfjfi5w77zwvgcgze">fatcat:yezqvwkjbjfjfi5w77zwvgcgze</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210624202122/https://arxiv.org/pdf/2106.11818v1.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/62/ac/62ac4c0bcb6c46318ea0d34326ab943ce1bcdf93.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2106.11818v1" 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>

On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited control

Yannick Forster, Ohad Kammar, Sam Lindley, Matija Pretnar
<span title="2017-08-29">2017</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dqy7qc7jkzal5bz3gueys3siz4" style="color: black;">Proceedings of the ACM on Programming Languages</a> </i> &nbsp;
It also demonstrates the sensitivity of the relative expressiveness of user-defined effects to seemingly orthogonal language features.  ...  We use the adequate finitary set-theoretic denotational semantics for the monadic calculus to show that effect handlers cannot be macro-expressed while preserving typeability either by monadic reflection  ...  We adapt Felleisen's approach to the situation where one extension L 1 + of a base calculus L is macro expressible in another extension L 2 + of the same base calculus L.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3110257">doi:10.1145/3110257</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/journals/pacmpl/0002KLP17.html">dblp:journals/pacmpl/0002KLP17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/26dm2333znhmfjn223p5vtxrb4">fatcat:26dm2333znhmfjn223p5vtxrb4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180722161310/https://www.pure.ed.ac.uk/ws/files/39861841/effmondel.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/22/b8/22b8d12fe5badfea7cea17e103b2ceeb127cc2a1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3110257"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

On the expressive power of user-defined effects: Effect handlers, monadic reflection, delimited control

YANNICK FORSTER, OHAD KAMMAR, SAM LINDLEY, MATIJA PRETNAR
<span title="">2019</span> <i title="Cambridge University Press (CUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uxwkeespobabbhdznzmxrfucny" style="color: black;">Journal of functional programming</a> </i> &nbsp;
It also demonstrates the sensitivity of the relative expressiveness of user-defined effects to seemingly orthogonal language features.  ...  We use the adequate finitary set-theoretic denotational semantics for the monadic calculus to show that effect handlers cannot be macro expressed while preserving typeability either by monadic reflection  ...  We adapt Felleisen's approach to the situation where one extension L 1 + of a base calculus L is macro expressible in another extension L 2 + of the same base calculus L.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s0956796819000121">doi:10.1017/s0956796819000121</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4lvaaamf6ffxbb6i26kkia5mjq">fatcat:4lvaaamf6ffxbb6i26kkia5mjq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210427135624/https://www.pure.ed.ac.uk/ws/files/181212587/effmondel.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/2a/682a57596dff2f76cc044811fa57afae991a0c7d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s0956796819000121"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> cambridge.org </button> </a>

Engineering formal metatheory

Brian Aydemir, Arthur Charguéraud, Benjamin C. Pierce, Randy Pollack, Stephanie Weirich
<span title="2008-01-14">2008</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xu5bk2lj5rbdxlx6222nw7tsxi" style="color: black;">SIGPLAN notices</a> </i> &nbsp;
to developments that are faithful to informal practice, yet require no external tool support and little infrastructure within the proof assistant.  ...  Our developments include type soundness for System F<: and core ML (with references, exceptions, datatypes, recursion, and patterns) and subject reduction for the Calculus of Constructions.  ...  Aside from typing decidable, the only situations in our developments where they are required are in the proofs of confluence for beta reduction in the lambda calculus and the Calculus of Constructions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1328897.1328443">doi:10.1145/1328897.1328443</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/g3tgwhyi4zf5rayeizyarmtawa">fatcat:g3tgwhyi4zf5rayeizyarmtawa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170812163050/http://homepages.inf.ed.ac.uk/rpollack/export/popl117-aydemir.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/2c/c12c638a942cce2b52c3a97431c66acce24d5bec.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1328897.1328443"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Engineering formal metatheory

Brian Aydemir, Arthur Charguéraud, Benjamin C. Pierce, Randy Pollack, Stephanie Weirich
<span title="">2008</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2qaxtqe2rfgjnfefqcokcnzelq" style="color: black;">Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL &#39;08</a> </i> &nbsp;
to developments that are faithful to informal practice, yet require no external tool support and little infrastructure within the proof assistant.  ...  Our developments include type soundness for System F<: and core ML (with references, exceptions, datatypes, recursion, and patterns) and subject reduction for the Calculus of Constructions.  ...  Aside from typing decidable, the only situations in our developments where they are required are in the proofs of confluence for beta reduction in the lambda calculus and the Calculus of Constructions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1328438.1328443">doi:10.1145/1328438.1328443</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/popl/AydemirCPPW08.html">dblp:conf/popl/AydemirCPPW08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fplnrrlowba4bi5zcr4fvvnguu">fatcat:fplnrrlowba4bi5zcr4fvvnguu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170812163050/http://homepages.inf.ed.ac.uk/rpollack/export/popl117-aydemir.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/2c/c12c638a942cce2b52c3a97431c66acce24d5bec.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1328438.1328443"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A Lightweight Formalization of the Metatheory of Bisimulation-Up-To

Kaustuv Chaudhuri, Matteo Cimini, Dale Miller
<span title="">2015</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/v2jnxq36qfdxhby7zfh6sfsc4e" style="color: black;">Proceedings of the 2015 Conference on Certified Programs and Proofs - CPP &#39;15</a> </i> &nbsp;
This paper is devoted to the formalization of the meta theory of several major bisimulation-up-to techniques for the process calculi CCS and the π-calculus (with replication).  ...  The bisimulation-up-to technique has been developed to reduce the size of the relations being computed while retaining soundness, that is, the guarantee of the existence of a bisimulation.  ...  We thank the anonymous reviewers for their comments on an earlier draft of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2676724.2693170">doi:10.1145/2676724.2693170</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/cpp/ChaudhuriCM15.html">dblp:conf/cpp/ChaudhuriCM15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/inwj7g7jsjgd3ktst6oqjbxkgu">fatcat:inwj7g7jsjgd3ktst6oqjbxkgu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190309203613/https://core.ac.uk/download/pdf/52898640.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/36/8c/368c1731df9005e6c520d49ba2d1bf53aaf4403e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2676724.2693170"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A Linear Algebra Approach to Linear Metatheory [article]

James Wood, Robert Atkey
<span title="2020-11-06">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We present a methodology based on linear algebra over semirings, extending McBride's kits and traversals approach for the metatheory of syntax with binding to linear usage-annotated terms.  ...  Tracking the usage of variables in contexts places more constraints on how variables may be renamed or substituted.  ...  Using methods like these can reduce the effort required to develop a new calculus and its metatheory.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2005.02247v2">arXiv:2005.02247v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/snwvw3z3e5h4jfeoic2whj7ifi">fatcat:snwvw3z3e5h4jfeoic2whj7ifi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201110001554/https://arxiv.org/pdf/2005.02247v2.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/41/0c/410cf0bab589064f7727e453c952e218912c540d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2005.02247v2" 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>
&laquo; Previous Showing results 1 &mdash; 15 out of 769 results