Filters








31 Hits in 6.0 sec

Constraint-based correctness proofs for logic program transformations

Alberto Pettorossi, Maurizio Proietti, Valerio Senni
<span title="2012-06-29">2012</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/oeimezgcfbas7drzmyhogjmlb4" style="color: black;">Formal Aspects of Computing</a> </i> &nbsp;
Many approaches proposed in the literature for proving the correctness of unfold/fold transformations of logic programs make use of measures associated with program clauses.  ...  When from a program P 1 we derive a program P 2 by a applying a sequence of transformations, suitable conditions on the measures of the clauses in P 2 guarantee that the transformation of P 1 into P 2  ...  We thank John Gallagher and Hirohisa Seki for stimulating discussions on the issues addressed in this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00165-012-0233-8">doi:10.1007/s00165-012-0233-8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4rdx3hobvjamjcqiyhk3qrkl6m">fatcat:4rdx3hobvjamjcqiyhk3qrkl6m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922005106/http://www.iasi.cnr.it/~proietti/papers/IASI_R_11-24_PetProSen.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/34/fe/34fe6b998501a32b17abff82a8008b0686ef7ae3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00165-012-0233-8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Programming and Reasoning with Guarded Recursion for Coinductive Types [article]

Ranald Clouston, Aleš Bizjak, Hans Bugge Grathwohl, Lars Birkedal
<span title="2015-01-15">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Guarded recursive types may be transformed into coinductive types by a type-former inspired by modal logic and Atkey-McBride clock quantification, allowing the typing of acausal functions.  ...  We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types.  ...  Acknowledgements We gratefully acknowledge our discussions with Andreas Abel, Tadeusz Litak, Stefan Milius, Rasmus Møgelberg, Filip Sieczkowski, and Andrea Vezzosi, and the comments of the reviewers.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1501.02925v2">arXiv:1501.02925v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ncijgig3wrgzlakkiyr2bydh4a">fatcat:ncijgig3wrgzlakkiyr2bydh4a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826170007/https://arxiv.org/pdf/1501.02925v2.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/0f/b3/0fb384ce6af42f6b1a187d4556e3596c4cc5410a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1501.02925v2" 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>

The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types

Ranald Clouston, Aleš Bizjak, Hans Grathwohl, Lars Birkedal, Andrzej Tarlecki
<span title="2017-04-27">2017</span> <i title="Logical Methods in Computer Science e.V."> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/c67srop7pbe3nciquoxzy3d6pm" style="color: black;">Logical Methods in Computer Science</a> </i> &nbsp;
Guarded recursive types may be transformed into coinductive types by a type-former inspired by modal logic and Atkey-McBride clock quantification, allowing the typing of acausal functions.  ...  The adequacy proof entails that the evaluation of a program always terminates. We introduce a program logic with L\"ob induction for reasoning about the contextual equivalence of programs.  ...  Acknowledgements We gratefully acknowledge our discussions with Andreas Abel, Robbert Krebbers, Tadeusz Litak, Stefan Milius, Rasmus Møgelberg, Filip Sieczkowski, Bas Spitters, and Andrea Vezzosi, and  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2168/lmcs-12(3:7)2016">doi:10.2168/lmcs-12(3:7)2016</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/exlvfja52jbqxa345r6osd4vwm">fatcat:exlvfja52jbqxa345r6osd4vwm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180721173428/https://lmcs.episciences.org/2019/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/c0/89/c089dca2f57df685f8adb8cca134365daa8c830c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2168/lmcs-12(3:7)2016"> <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>

Programming and Reasoning with Guarded Recursion for Coinductive Types [chapter]

Ranald Clouston, Aleš Bizjak, Hans Bugge Grathwohl, Lars Birkedal
<span title="">2015</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 logic is based on the internal logic of the topos of trees, with modalities , on predicates, and Löb induction for reasoning about functions on both guarded recursive and coinductive types.  ...  Guarded recursive types may be transformed into coinductive types by a type-former inspired by modal logic and Atkey-McBride clock quantification, allowing the typing of acausal functions.  ...  Acknowledgements We gratefully acknowledge our discussions with Andreas Abel, Tadeusz Litak, Stefan Milius, Rasmus Møgelberg, Filip Sieczkowski, and Andrea Vezzosi, and  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-46678-0_26">doi:10.1007/978-3-662-46678-0_26</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cvxdii63ivgc3pdrlv3ckawrj4">fatcat:cvxdii63ivgc3pdrlv3ckawrj4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810050439/http://www.cs.au.dk/~birke/papers/guarded-lambda-conf.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/4c/a6/4ca609be2e0d551c2e972a4f30feb5856fc60196.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-46678-0_26"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Analysis and Transformation of Constrained Horn Clauses for Program Verification [article]

Emanuele De Angelis
<span title="2021-08-02">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This paper surveys recent work on applying analysis and transformation techniques that originate in the field of constraint logic programming (CLP) to the problem of verifying software systems.  ...  We also give an overview of some transformation techniques based on specialisation and fold/unfold rules, which are useful for improving the effectiveness of CHC satisfiability tools.  ...  We are also grateful to the Editor-in-Chief Mirosław Truszczyński and the anonymous reviewers for their comments and suggestions, all of which have contributed to improving our manuscript.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2108.00739v1">arXiv:2108.00739v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gevl2xlor5hrzentqc77irt6gu">fatcat:gevl2xlor5hrzentqc77irt6gu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210804150346/https://arxiv.org/pdf/2108.00739v1.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/b2/54b235bad1ff26a7ffb25c4c9d4990a3f634507d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2108.00739v1" 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>

Termination and Productivity Checking with Continuous Types [chapter]

Andreas Abel
<span title="">2003</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 analyze the interpretation of inductive and coinductive types as sets of strongly normalizing terms and isolate classes of types with certain continuity properties.  ...  Our result enables us to relax some side conditions on the shape of recursive definitions which are accepted by the type-based termination calculus of Barthe, Frade, Giménez, Pinto and Uustalu, thus enlarging  ...  Proof. By induction on Γ X para τ , using Lemmata 7 and 8.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-44904-3_1">doi:10.1007/3-540-44904-3_1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/65jxh4bvibf6xbhkbpjy4e7xhm">fatcat:65jxh4bvibf6xbhkbpjy4e7xhm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20081002154117/http://www.tcs.ifi.lmu.de/~abel/tlca03.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/97/a8/97a88952cf1d5d342c4f1755f3af2dff6c835a3c.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-44904-3_1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Polarized Subtyping: Code/Artifact [article]

Zeeshan Lakhani, Ankush Das, Henry DeYoung, Andreia Mordido, Frank Pfenning
<span title="2022-01-28">2022</span> <i title="Zenodo"> Zenodo </i> &nbsp;
code (the Polite programming language), and related files are packaged within the docker container (available on Github Packages and in this submission).  ...  The artifact will not run on arm64 hosts (e.g. an M1 macbook). 3.  ...  Support for this research was provided by the NSF under Grant No. 1718276 and by FCT through the CMU Portugal Program, the LASIGE Research Unit (UIDB/00408/2020 and UIDP/00408/2020), and the project SafeSessions  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.5913940">doi:10.5281/zenodo.5913940</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lu44crp54raahp6pwjwncgyylm">fatcat:lu44crp54raahp6pwjwncgyylm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220131192548/https://zenodo.org/record/5913940/files/2201.10998.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/a0/31/a031f5ef0e496adf95f0e98515197c3d8b8f0ada.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.5913940"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> zenodo.org </button> </a>

Automatic induction proofs of data-structures in imperative programs

Duc-Hiep Chu, Joxan Jaffar, Minh-Thai Trinh
<span title="">2015</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jpubwsjaozha5itdes6pzyz2fm" style="color: black;">Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2015</a> </i> &nbsp;
We first show that some proof obligations that are dynamically generated in the process can be used as induction hypotheses in the future, and then we show how to use these hypotheses in an induction step  ...  A proof, using U+M, succeeds when we find a sequence of transformations that produces a final formula which is obviously provable by simply matching terms.  ...  Therefore, regardless of the unfolding/folding sequence, the arguments y on the LHS and z on the RHS would maintain and can never be matched satisfactorily.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2737924.2737984">doi:10.1145/2737924.2737984</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/pldi/ChuJT15.html">dblp:conf/pldi/ChuJT15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xsa5w26zdvdsbpsn2qituyvflm">fatcat:xsa5w26zdvdsbpsn2qituyvflm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809143426/http://www.comp.nus.edu.sg/~joxan/papers/induct.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/8e/71/8e71b8e45a5b16192eacc2f4c4f281d3aec97efa.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2737924.2737984"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Automatic induction proofs of data-structures in imperative programs

Duc-Hiep Chu, Joxan Jaffar, Minh-Thai Trinh
<span title="2015-06-03">2015</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;
We first show that some proof obligations that are dynamically generated in the process can be used as induction hypotheses in the future, and then we show how to use these hypotheses in an induction step  ...  A proof, using U+M, succeeds when we find a sequence of transformations that produces a final formula which is obviously provable by simply matching terms.  ...  Therefore, regardless of the unfolding/folding sequence, the arguments y on the LHS and z on the RHS would maintain and can never be matched satisfactorily.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2813885.2737984">doi:10.1145/2813885.2737984</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/apu7ynjkyrc5zftccbeokf4psy">fatcat:apu7ynjkyrc5zftccbeokf4psy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809143426/http://www.comp.nus.edu.sg/~joxan/papers/induct.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/8e/71/8e71b8e45a5b16192eacc2f4c4f281d3aec97efa.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2813885.2737984"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A duality between proof systems for cyclic term graphs

CLEMENS GRABMAYER
<span title="">2007</span> <i title="Cambridge University Press (CUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jdpukxfslnfmradqb65llq43na" style="color: black;">Mathematical Structures in Computer Science</a> </i> &nbsp;
This result sheds additional light on the axiomatisation of Brandt and Henglein: it provides an alternative soundness proof for the adaptation considered here.  ...  1998) and of a proof system by Ariola and Klop (Ariola and Klop 1995) for consistency checking.  ...  Acknowledgments I would like to thank Jan Willem Klop for suggesting an investigation into the prooftheoretic connections between proof systems for cyclic objects, for a basic idea and for helping with  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s0960129507006111">doi:10.1017/s0960129507006111</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/og4tupxd6fa6je5qy5wderfvzy">fatcat:og4tupxd6fa6je5qy5wderfvzy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190218091150/http://pdfs.semanticscholar.org/0a4c/75e69e3fa6719ad89d7e876b23eba0f4619d.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/0a/4c/0a4c75e69e3fa6719ad89d7e876b23eba0f4619d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s0960129507006111"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> cambridge.org </button> </a>

A Model of Countable Nondeterminism in Guarded Type Theory [chapter]

Aleš Bizjak, Lars Birkedal, Marino Miculan
<span title="">2014</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We call reductions of the form unfold (fold v) v unfold-fold reductions and reductions of the form ? n (n ∈ N) choice reductions.  ...  • e p e if e * e and none of the reductions is a choice reduction• e 0 e if e * e and none of the reductions is an unfold-fold reduction • e 1 e if e * e and exactly one of the reductions is an unfold-fold  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-08918-8_8">doi:10.1007/978-3-319-08918-8_8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wbr3jneuirgpviah3tpfrzergm">fatcat:wbr3jneuirgpviah3tpfrzergm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706071304/http://www.cs.au.dk/%7Eabizjak/documents/trs/cntbl-gtt-tr.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/d2/66/d2662e5776faf67e85b67d9748b3a6e9976d88e4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-08918-8_8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Automating Proofs of Data-Structure Properties in Imperative Programs [article]

Duc-Hiep Chu, Joxan Jaffar, Minh-Thai Trinh
<span title="2014-07-23">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The state-of-the-art methods are limited to the unfold-and-match (U+M) paradigm, where predicates are transformed via (un)folding operations induced from their definitions before being treated as uninterpreted  ...  Our contribution is a proof method which -- beyond U+M -- performs automatic formula re-writing by treating previously encountered obligations in each proof path as possible induction hypotheses.  ...  Therefore, regardless of the unfolding/folding sequence, the arguments y on the LHS and z on the RHS would maintain and can never be matched satisfactorily.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1407.6124v1">arXiv:1407.6124v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hyihb6kn3bbofahny6bis2upiu">fatcat:hyihb6kn3bbofahny6bis2upiu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191021162111/https://arxiv.org/pdf/1407.6124v1.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/17/38/17381fde8f6e24068af971408efd7d7e18e20677.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1407.6124v1" 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>

Guarded Cubical Type Theory: Path Equality for Guarded Recursion [article]

Lars Birkedal, Aleš Bizjak, Ranald Clouston, Hans Bugge Grathwohl, Bas Spitters, Andrea Vezzosi
<span title="2016-06-28">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
GDTT is an extensional type theory with guarded recursive types, which are useful for building models of program logics, and for programming and reasoning with coinductive types.  ...  We wish to implement GDTT with decidable type-checking, while still supporting non-trivial equality proofs that reason about the extensions of guarded recursive constructions.  ...  We gratefully acknowledge our discussions with Thierry Coquand, and the comments of our reviewers.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1606.05223v2">arXiv:1606.05223v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3xtnwqsr7zcuhlzshbu6cuvrey">fatcat:3xtnwqsr7zcuhlzshbu6cuvrey</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200824203050/https://arxiv.org/pdf/1606.05223v2.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/d5/0b/d50b1e39ea6ad7888bbc9343c508a616bb656514.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1606.05223v2" 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>

Stream-oriented robotics programming: The design of roshask

Anthony Cowley, Camillo J. Taylor
<span title="">2011</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dmucnarmarh2fj6syg5jyqs7ny" style="color: black;">2011 IEEE/RSJ International Conference on Intelligent Robots and Systems</a> </i> &nbsp;
This approach makes the fusing, transforming, and filtering of streams fully generic and compositional while maintaining full compatibility with the existing ROS ecosystem.  ...  The novelty of these bindings is that they allow for, and encourage, a higher level of abstraction in writing programs for robots that treat streams of values as firstclass citizens.  ...  Gibbons [11] identifies the reverse composition, unfoldfold , as transforming one data structure into another by tearing down the first to produce a seed that is used to germinate the second.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/iros.2011.6095033">doi:10.1109/iros.2011.6095033</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/iros/CowleyT11.html">dblp:conf/iros/CowleyT11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7m7wdxdlh5g5vir2qrexxviice">fatcat:7m7wdxdlh5g5vir2qrexxviice</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130108010916/http://www.cis.upenn.edu/~cjtaylor/PUBLICATIONS/pdfs/CowleyTaylorIROS11b.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/18/b7/18b75f78c38b3fed12885b3cfb802391b8bf17a3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/iros.2011.6095033"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Stream-oriented robotics programming: The design of roshask

A. Cowley, C. J. Taylor
<span title="">2011</span> <i title="IEEE"> 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems </i> &nbsp;
This approach makes the fusing, transforming, and filtering of streams fully generic and compositional while maintaining full compatibility with the existing ROS ecosystem.  ...  The novelty of these bindings is that they allow for, and encourage, a higher level of abstraction in writing programs for robots that treat streams of values as firstclass citizens.  ...  Gibbons [11] identifies the reverse composition, unfoldfold , as transforming one data structure into another by tearing down the first to produce a seed that is used to germinate the second.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/iros.2011.6048682">doi:10.1109/iros.2011.6048682</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wacppohozne2lf7s6nzqx5s5he">fatcat:wacppohozne2lf7s6nzqx5s5he</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130108010916/http://www.cis.upenn.edu/~cjtaylor/PUBLICATIONS/pdfs/CowleyTaylorIROS11b.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/18/b7/18b75f78c38b3fed12885b3cfb802391b8bf17a3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/iros.2011.6048682"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 31 results