المؤلفون: Pous, Damien, Rot, Jurriaan, Turkenburg, Ruben

المساهمون: Preuves et Langages (PLUME), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Radboud University Nijmegen, Helle Hvid Hansen and Fabio Zanasi, Plume, ANR-10-LABX-0070,MILYON,Community of mathematics and fundamental computer science in Lyon(2010)

المصدر: Coalgebraic Methods in Computer Science ; https://hal.science/hal-03694381 ; Coalgebraic Methods in Computer Science, Apr 2022, Munich, Germany. ⟨10.1007/978-3-031-10736-8_7⟩

مصطلحات موضوعية: Coalgebra, Corecursion, Coinduction, Final sequence, [INFO]Computer Science [cs]

جغرافية الموضوع: Munich, Germany

Relation: hal-03694381; https://hal.science/hal-03694381; https://hal.science/hal-03694381/document; https://hal.science/hal-03694381/file/causal-up-to.pdf

الاتاحة: https://hal.science/hal-03694381
https://hal.science/hal-03694381/document
https://hal.science/hal-03694381/file/causal-up-to.pdf
https://doi.org/10.1007/978-3-031-10736-8_7

المؤلفون: Santo, José Espírito, Matthes, Ralph, Pinto, Luís

المساهمون: Universidade do Minho = University of Minho Braga, Assistance à la Certification d’Applications DIstribuées et Embarquées (IRIT-ACADIE), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Fundação para a Ciência e a Tecnologia UIDB/00013/2020 and UIDP/00013/2020, ANR-11-BS02-0016,CLIMT,Méthodes catégoriques et logiques en transformations de modèles(2011), European Project: COST Action CA15123 ,COST - European Cooperation in Science and Technology,EUTYPES(2016)

المصدر: ISSN: 0168-0072 ; Annals of Pure and Applied Logic ; https://hal.science/hal-03086504 ; Annals of Pure and Applied Logic, 2021, 172 (10), ⟨10.1016/j.apal.2021.103026⟩.

مصطلحات موضوعية: Curry-Howard isomorphism, proof search, coinduction / corecursion, inhabitation problem, solution space, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [MATH.MATH-CT]Mathematics [math]/Category Theory [math.CT], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1602.04382; info:eu-repo/grantAgreement//COST Action CA15123 /EU/The European research network on types for programming and verification /EUTYPES; hal-03086504; https://hal.science/hal-03086504; https://hal.science/hal-03086504/document; https://hal.science/hal-03086504/file/S0168007221000841.pdf; ARXIV: 1602.04382; PII: S0168-0072(21)00084-1

الاتاحة: https://hal.science/hal-03086504
https://hal.science/hal-03086504/document
https://hal.science/hal-03086504/file/S0168007221000841.pdf
https://doi.org/10.1016/j.apal.2021.103026

المؤلفون: Czajka, Łukasz

المساهمون: Łukasz Czajka

مصطلحات موضوعية: coinduction, Coq, guardedness, corecursion

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 141, 10th International Conference on Interactive Theorem Proving (ITP 2019); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2019.14

الاتاحة: https://doi.org/10.4230/LIPIcs.ITP.2019.14
https://nbn-resolving.org/urn:nbn:de:0030-drops-110690
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2019.14

المؤلفون: Traytel, Dmitriy, id_orcid:0 000-0001-7982-2768

المساهمون: Pientka, Brigitte, Kesner, Delia

المصدر: Leibniz International Proceedings in Informatics (LIPIcs), 52 ; 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)

مصطلحات موضوعية: Formal languages, Codatatypes, Corecursion, Coinduction, Interactive theorem proving, Isabelle/HOL

وصف الملف: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-010-1; http://hdl.handle.net/20.500.11850/118425; urn:isbn:978-3-95977-010-1

الاتاحة: https://hdl.handle.net/20.500.11850/118425
https://doi.org/10.3929/ethz-b-000118425

المؤلفون: Jost, Steffen, Vasconcelos, Pedro, Florido, Mário, Hammond, Kevin

المصدر: Jost , S , Vasconcelos , P , Florido , M & Hammond , K 2017 , ' Type-based cost analysis for lazy functional languages ' , Journal of Automated Reasoning , vol. 59 , no. 1 , pp. 87-120 . https://doi.org/10.1007/s10817-016-9398-9

مصطلحات موضوعية: Automated static analysis, Lazy evaluation, Corecursion, Amortised analysis, Type systems, Functional programming

وصف الملف: application/pdf

الاتاحة: https://risweb.st-andrews.ac.uk/portal/en/researchoutput/typebased-cost-analysis-for-lazy-functional-languages(85bc16ea-6b31-4e68-936b-c63177309007).html
https://doi.org/10.1007/s10817-016-9398-9
https://research-repository.st-andrews.ac.uk/bitstream/10023/12441/1/JAR2015_5.pdf

المؤلفون: Damien Pous, Jurriaan Rot, Ruben Turkenburg

المساهمون: Preuves et Langages (PLUME), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Radboud University [Nijmegen], Helle Hvid Hansen and Fabio Zanasi, Plume, ANR-10-LABX-0070,MILYON,Community of mathematics and fundamental computer science in Lyon(2010)

المصدر: Coalgebraic Methods in Computer Science
Coalgebraic Methods in Computer Science, Apr 2022, Munich, Germany. ⟨10.1007/978-3-031-10736-8_7⟩
Coalgebraic Methods in Computer Science ISBN: 9783031107351

مصطلحات موضوعية: Coalgebra, Computer Science::Logic in Computer Science, Coinduction, Computer Science::Programming Languages, Corecursion, [INFO]Computer Science [cs], Final sequence

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb16d0948ca379799405b459f9d99fb5
https://hal.science/hal-03694381

المؤلفون: Komendantskaya, Ekaterina, Power, John, Schmidt, Martin

المصدر: Komendantskaya , E , Power , J & Schmidt , M 2016 , ' Coalgebraic logic programming : from semantics to implementation ' , Journal of Logic and Computation , vol. 26 , no. 2 , pp. 745 - 783 . https://doi.org/10.1093/logcom/exu026

مصطلحات موضوعية: logic programing, coalgebra, parallelism, coinduction, corecursion, observational semantics

وصف الملف: application/pdf

الاتاحة: https://researchportal.bath.ac.uk/en/publications/1b90e143-f98e-40dd-875f-98d55d6b4b99
https://doi.org/10.1093/logcom/exu026
https://purehost.bath.ac.uk/ws/files/44941759/KomendantskayaPowerSchmidtJLC14.pdf

المؤلفون: Kurz, Alexander A., Petrisan, Daniela, Severi, Paula, de Vries, Fer-Jan

مصطلحات موضوعية: Science & Technology, Technology, Computer Science, Theory & Methods, Logic, Science & Technology - Other Topics, coinduction, corecursion, nominal sets, infinitary lambda calculus, ALPHA-STRUCTURAL RECURSION, INDUCTION, FUNCTORS, BINDING

Relation: Logical Methods in Computer Science, 2013, 9 (4), 20; http://www.lmcs-online.org/ojs/viewarticle.php?id=1344; http://hdl.handle.net/2381/32545

الاتاحة: http://www.lmcs-online.org/ojs/viewarticle.php?id=1344
http://hdl.handle.net/2381/32545
https://doi.org/10.2168/LMCS-9(4:20)2013

المؤلفون: Bertot, Yves, Komendantskaya, Ekaterina

المساهمون: Mathematical, Reasoning and Software (MARELLE), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Stefano Berardi and Feruccio Damiani and Ugo de Liguoro, ANR-05-BLAN-0146,A3PAT,Assister Automatiquement les Assistants de Preuve Avec des Traces(2005)

المصدر: Types 2008 ; https://hal.inria.fr/inria-00322331 ; Types 2008, 2008, Torino, Italy. pp.220-236

مصطلحات موضوعية: Constructive Type Theory, Structural Recursion, Co-inductive types, Calculus of Constructions, Coinductive types, Corecursion, Coq, ACM: I.: Computing Methodologies, ACM: F.: Theory of Computation, ACM: D.: Software, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT]

جغرافية الموضوع: Torino, Italy

Relation: info:eu-repo/semantics/altIdentifier/arxiv/0903.3850; inria-00322331; https://hal.inria.fr/inria-00322331; https://hal.inria.fr/inria-00322331v4/document; https://hal.inria.fr/inria-00322331v4/file/fibonacci.pdf; ARXIV: 0903.3850

الاتاحة: https://hal.inria.fr/inria-00322331
https://hal.inria.fr/inria-00322331v4/document
https://hal.inria.fr/inria-00322331v4/file/fibonacci.pdf

المؤلفون: Setzer, Anton, Hancock, Peter

المساهمون: Anton Setzer and Peter Hancock

مصطلحات موضوعية: Dependently types programming, interactive programs, coalgebras, weakly final coalgebras, coiteration, corecursion, monad

وصف الملف: application/pdf

Relation: Is Part Of Dagstuhl Seminar Proceedings, Volume 4381, Dependently Typed Programming (2005); https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04381.2

الاتاحة: https://doi.org/10.4230/DagSemProc.04381.2
https://nbn-resolving.org/urn:nbn:de:0030-drops-1768
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04381.2

المؤلفون: Komendantskaya, E., Schmidt, M., Heras, J.

مصطلحات موضوعية: Coinduction, Corecursion, GoLang, Guardedness, Parallelism

وصف الملف: application/pdf

Relation: info:eu-repo/semantics/altIdentifier/pissn/1571-0661; Exploiting parallelism in coalgebraic logic programming, 2014, vol. 303, pág. 121-148; https://investigacion.unirioja.es/documentos/5bbc687bb750603269e809b1; urn:issn:1571-0661

الاتاحة: https://investigacion.unirioja.es/documentos/5bbc687bb750603269e809b1
https://doi.org/10.1016/J.ENTCS.2014.02.007

المؤلفون: Kurz, Alexander, Petrişan, Daniela, Severi, Paula, de Vries, Fer-Jan

المصدر: Engineering Faculty Articles and Research

مصطلحات موضوعية: coinduction, corecursion, nominal sets, infinitary lambda calculus, Algebra, Logic and Foundations, Other Computer Engineering, Other Computer Sciences, Other Mathematics

وصف الملف: application/pdf

Relation: https://digitalcommons.chapman.edu/engineering_articles/5; https://digitalcommons.chapman.edu/cgi/viewcontent.cgi?article=1004&context=engineering_articles

الاتاحة: https://digitalcommons.chapman.edu/engineering_articles/5
https://digitalcommons.chapman.edu/cgi/viewcontent.cgi?article=1004&context=engineering_articles

المؤلفون: Paul Downen, Zena M. Ariola

المصدر: PPDP

مصطلحات موضوعية: Evaluation strategy, Computer science, Duality (mathematics), Coinduction, Recursion (computer science), 020207 software engineering, 02 engineering and technology, Inductive reasoning, Corecursion, Abstract machine, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Control flow, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, 0202 electrical engineering, electronic engineering, information engineering, Calculus, 020201 artificial intelligence & image processing

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::6c13de9f977d8c060f6038438f021a3a
https://doi.org/10.1145/3414080.3414086

المؤلفون: Nikolay Shilov

المصدر: Modelirovanie i Analiz Informacionnyh Sistem, Vol 25, Iss 5, Pp 549-560 (2018)

مصطلحات موضوعية: 0209 industrial biotechnology, Recursion, Computer science, recursion elimination, 02 engineering and technology, Information technology, T58.5-58.64, Corecursion, static and dynamic memory, ascending and descending dynamic programming, Dynamic programming, Algebra, recursive and standard program schemata, Automated theorem proving, 020901 industrial engineering & automation, Transformation (function), TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, functional equivalence of programs and program schemata, recursive and iterative programs, 0202 electrical engineering, electronic engineering, information engineering, Functional equivalence, associative and standard arrays, 020201 artificial intelligence & image processing, Algorithm design

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88bc40461e6853007b70d21dd0cb9d7c
https://www.mais-journal.ru/jour/article/view/756

المؤلفون: Picard, Célia, Matthes, Ralph

المساهمون: Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT), Assistance à la Certification d’Applications DIstribuées et Embarquées (IRIT-ACADIE), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Centre National de la Recherche Scientifique (CNRS)

المصدر: ISSN: 1863-2122 ; Electronic Communications of the EASST ; https://enac.hal.science/hal-02015853 ; Electronic Communications of the EASST, 2011, Graph Computation Models Selected Revised Papers from the Third International Workshop on Graph Computation Models (GCM 2010), 39.

مصطلحات موضوعية: theorem proving, guardedness, dependent types, metamodels, coinduction/corecursion, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Relation: hal-02015853; https://enac.hal.science/hal-02015853; https://enac.hal.science/hal-02015853/document; https://enac.hal.science/hal-02015853/file/649-1981-1-PB.pdf

الاتاحة: https://enac.hal.science/hal-02015853
https://enac.hal.science/hal-02015853/document
https://enac.hal.science/hal-02015853/file/649-1981-1-PB.pdf

المؤلفون: Yves Bertot, Ekaterina Komendantskaya

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://arxiv.org/pdf/0903.3850v1.pdf.

مصطلحات موضوعية: Key words, Constructive Type Theory, Structural Recursion, Coinductive types, Guarded Corecursion, Coq

وصف الملف: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.244.3914; http://arxiv.org/pdf/0903.3850v1.pdf

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.244.3914
http://arxiv.org/pdf/0903.3850v1.pdf

المؤلفون: Adam D. Barwell, Kevin Hammond, Christopher Brown

المساهمون: European Commission, EPSRC, University of St Andrews. School of Computer Science, University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra

المصدر: Future Generation Computer Systems. 79:669-686

مصطلحات موضوعية: pattern discovery, QA75, Computer Networks and Communications, Computer science, QA75 Electronic computers. Computer science, NDAS, 0102 computer and information sciences, 02 engineering and technology, Parallel computing, computer.software_genre, 01 natural sciences, Mutual recursion, GeneralLiterature_MISCELLANEOUS, QA76, QA76 Computer software, 0202 electrical engineering, electronic engineering, information engineering, Algorithmic skeleton, R2C, computer.programming_language, anti-unification, parallelism, Recursion, Programming language, ~DC~, Recursion (computer science), 020207 software engineering, Data structure, haskell, Corecursion, recursion schemes, Code refactoring, 010201 computation theory & mathematics, Hardware and Architecture, Haskell, Anti-unification, BDC, computer, Software

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6004bf59e984539a01219309e154fbfd
https://doi.org/10.1016/j.future.2017.07.024

المؤلفون: Sergio Mota

المصدر: Journal of Applied Logic. 25:89-108

مصطلحات موضوعية: Recursion, Double recursion, Logic, Left recursion, business.industry, Computer science, Applied Mathematics, 05 social sciences, Recursive definition, Corecursion, Mutual recursion, 050105 experimental psychology, Algebra, 03 medical and health sciences, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, 0302 clinical medicine, Mathematical induction, 0501 psychology and cognitive sciences, Structural induction, Artificial intelligence, business, 030217 neurology & neurosurgery

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::bee6ec74d82ee0da7202596f9578fdc8
https://doi.org/10.1016/j.jal.2017.03.003

المؤلفون: Lucia Klimentová

المصدر: Acta Mathematica Nitriensia. 3:7-14

مصطلحات موضوعية: Discrete mathematics, Double recursion, Limit of a sequence, Recursion (computer science), Limit (mathematics), General Agricultural and Biological Sciences, Corecursion, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::6d1072bfd0ea1d36968a7122f553ebdf
https://doi.org/10.17846/amn.2017.3.2.7-14

المؤلفون: Yue Li, Ekaterina Komendantskaya

المصدر: Theory and Practice of Logic Programming. 17:906-923

مصطلحات موضوعية: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Theoretical computer science, Horn clause, Computer science, media_common.quotation_subject, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, symbols.namesake, Turing completeness, Artificial Intelligence, 0202 electrical engineering, electronic engineering, information engineering, Logic programming, media_common, Soundness, Infinity, Data structure, Corecursion, Logic in Computer Science (cs.LO), Undecidable problem, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Computational Theory and Mathematics, 010201 computation theory & mathematics, Hardware and Architecture, symbols, 020201 artificial intelligence & image processing, Software

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::621da4675ce0b5b5db4332d0eff6fadb
https://doi.org/10.1017/s147106841700028x