Výsledky vyhledávání - "Typed lambda calculus"

A Note on Logical PERs and Reducibility. Logical Relations Strike Again!

Autoři: Gallier, Jean Jean Gallier

Přispěvatelé: Gallier, Jean Jean Gallier

Témata: logical relations, Typed lambda-calculus, per's, Church-Rosser property, strong normalization, ddc:004, reducibility

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Tannen.7

Non-Deterministic Functions as Non-Deterministic Processes (Extended Version)

Autoři: Joseph W. N. Paulus Daniele Nantes-Sobrinho Jorge A. Pérez

Zdroj: Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023)

Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Artificial intelligence, Logic, Linear logic, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Quantum mechanics, computer science - logic in computer science, Simply typed lambda calculus, Theoretical computer science, Engineering, Artificial Intelligence, Logic Programming and Knowledge Representation, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Encoding (memory), Lambda calculus, Nonmonotonic Reasoning, BC1-199, Determinism, Typed lambda calculus, Physics, FOS: Clinical medicine, Pi calculus, QA75.5-76.95, Church encoding, Computer science, Logic in Computer Science (cs.LO), Programming language, Algorithm, Aerospace engineering, Computational Theory and Mathematics, Constraint Logic Programming, Electronic computers. Computer science, Dentistry, Computer Science, Physical Sciences, Medicine, Program Analysis and Verification Techniques, Correctness, Intersection (aeronautics), Calculus (dental), Dependent type, Mathematics, Formal Methods in Software Verification and Control

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2104.14759
https://doaj.org/article/0117e6998a2f401aa9443b06066087df
https://research.rug.nl/en/publications/003e40cb-8b76-467b-90ed-e62a0ab7570f
https://hdl.handle.net/11370/003e40cb-8b76-467b-90ed-e62a0ab7570f
https://doi.org/10.46298/lmcs-19(4:1)2023

On Generalized Metric Spaces for the Simply Typed Lambda-Calculus

Autoři: Pistone P. Pistone, Paolo

Přispěvatelé: Pistone P. Pistone, Paolo

Zdroj: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

Témata: [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Generalized Metric Space, Simply Typed Lambda-Calculus, Cartesian Closed Categories, Quantitative Logical Relations, 16. Peace & justice, 01 natural sciences, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL]

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.archives-ouvertes.fr/hal-03346950/file/LICS2021named.pdf
https://dblp.uni-trier.de/db/conf/lics/lics2021.html#Pistone21
https://cris.unibo.it/handle/11585/834385.1
https://hal.archives-ouvertes.fr/hal-03346950
https://hal.archives-ouvertes.fr/hal-03346950/document
http://easyconferences.eu/lics2021/accepted-papers/#58

A Note on Confluence in Typed Probabilistic Lambda Calculi

Autoři: Romero, Lucas Rafael Díaz Caro, Alejandro

Zdroj: CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y Técnicas

Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Simply typed lambda calculus, Local confluence, Probabilistic rewriting system, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Logic in Computer Science (cs.LO)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2106.06633
http://hdl.handle.net/11336/204620

Cartesian closed bicategories : type theory and coherence

Autoři: Saville, Philip Fiore, Marcelo

Přispěvatelé: Saville, Philip Fiore, Marcelo

Témata: bicategory, cartesian closed, coherence, Lambek-Curry-Howard correspondence, simply-typed lambda calculus, 2-dimensional type theory, normalisation-by-evaluation

Přístupová URL adresa: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.861864

Towards logical foundations for probabilistic computation

Autoři: Antonelli, Melissa Dal Lago, Ugo Pistone, Paolo a další

Přispěvatelé: Antonelli, Melissa Dal Lago, Ugo Pistone, Paolo a další

Témata: Computer and information sciences, probabilistic computation, propositional logic, counting quantifiers, counting complexity, typed lambda-calculus

Popis souboru: application/pdf

Relation: Antonelli , M , Dal Lago , U & Pistone , P 2024 , ' Towards logical foundations for probabilistic computation ' , Annals of Pure and Applied Logic , vol. 175 , no. 9 . https://doi.org/10.1016/j.apal.2023.103341; http://hdl.handle.net/10138/585860; 85168005086; 001250025300002

Dostupnost: http://hdl.handle.net/10138/585860

Towards logical foundations for probabilistic computation

Autoři: Antonelli M. Dal Lago U. Pistone P. a další

Přispěvatelé: Antonelli M. Dal Lago U. Pistone P. a další

Zdroj: Annals of Pure and Applied Logic. 175:103341

Témata: Computer and information sciences, Counting complexity, Counting quantifiers, [INFO] Computer Science [cs], propositional logic, typed lambda-calculus, Typed λ-calculi, [INFO.INFO-MS] Computer Science [cs]/Mathematical Software [cs.MS], counting quantifiers, counting complexity, probabilistic computation, Propositional logic, Probabilistic computation, Typed lambda-calculi

Popis souboru: application/pdf

Přístupová URL adresa: https://inria.hal.science/hal-04835866v1
https://doi.org/10.1016/j.apal.2023.103341
http://hdl.handle.net/10138/585860

Higher-order pattern generalization modulo equational theories

Autoři: David M. Cerna Temur Kutsia Universitätsbibliothek

Přispěvatelé: David M. Cerna Temur Kutsia Universitätsbibliothek

Zdroj: Mathematical Structures in Computer Science. 30:627-663

Témata: anti-unification, Simply typed lambda calculus, 0202 electrical engineering, electronic engineering, information engineering, equational theories, higher-order patterns, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences

Přístupová URL adresa: https://www.cambridge.org/core/services/aop-cambridge-core/content/view/88E26F155F0FD02B3EDD648971D9AD1B/S0960129520000110a.pdf/div-class-title-higher-order-pattern-generalization-modulo-equational-theories-div.pdf
https://epub.jku.at/obvulioa/content/titleinfo/5901849
https://dblp.uni-trier.de/db/journals/mscs/mscs30.html#CernaK20
https://epub.jku.at/id/5901849
https://permalink.obvsg.at/ULI/AC16169955
https://doi.org/10.1017/s0960129520000110

Linear Lambda-Calculus is Linear

Autoři: Alejandro Díaz-Caro Gilles Dowek Dowek, Gilles a další

Přispěvatelé: Alejandro Díaz-Caro Gilles Dowek Dowek, Gilles a další

Témata: Foundations of Quantum Mechanics and Interpretations, Mathematical proof, Linear logic, Geometry, [MATH] Mathematics [math], [INFO] Computer Science [cs], 7. Clean energy, Logic programming, Description Logics, Logic Programming and Knowledge Representation, Artificial Intelligence, Temporal Logic, Quantum Computing and Simulation, FOS: Mathematics, Lambda calculus, Nonmonotonic Reasoning, Algebra over a field, Typed lambda calculus, 4. Education, FOS: Clinical medicine, Proof theory, Pure mathematics, Quantum computing, Discrete mathematics, Computer science, Atomic and Molecular Physics, and Optics, Programming language, Physics and Astronomy, Constraint Logic Programming, Dentistry, Physical Sciences, Computer Science, Medicine, ddc:004, Calculus (dental), Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: https://inria.hal.science/hal-03959343v1
https://inria.hal.science/hal-03959343v1/document
https://doi.org/10.4230/lipics.fscd.2022.21
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2022.21

Predication and cognitive context: Between minimalism and contextualism

Autoři: Balletta, Sandro Domaneschi, Filippo

Zdroj: Ratio. 32:182-191

Témata: 0602 languages and literature, 05 social sciences, 0501 psychology and cognitive sciences, 06 humanities and the arts, cognitive context, contextualism, minimalism, predication, semantics, typed lambda calculus

Popis souboru: application/pdf

Přístupová URL adresa: https://iris.unige.it/bitstream/11567/965108/1/Balletta_et_al-2019-Ratio.pdf
https://iris.unige.it/handle/11567/965108
https://philpapers.org/rec/BALPAC-4
https://onlinelibrary.wiley.com/doi/abs/10.1111/rati.12245?af=R
https://hdl.handle.net/11567/965108
https://doi.org/10.1111/rati.12245

Proving Termination With CPO --Full Version

Autoři: Díaz-Caro, Alejandro Dowek, Gilles Jouannaud, Jean-Pierre a další

Přispěvatelé: Díaz-Caro, Alejandro Dowek, Gilles Jouannaud, Jean-Pierre a další

Zdroj: https://inria.hal.science/hal-05146299 ; 2025.

Témata: Quantum calculi, Computability path ordering, Path orderings, Termination proof, Higher-order rewrite rules, Typed lambda calculus, ACM: F.: Theory of Computation, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Dostupnost: https://inria.hal.science/hal-05146299
https://inria.hal.science/hal-05146299v2/document
https://inria.hal.science/hal-05146299v2/file/ProvingTerminationWithCPO--FullVersion.pdf

On Correspondence between Selective CPS Transformation and Selective Double Negation Translation

Autoři: Hyeonseung Im

Zdroj: Mathematics, Vol 9, Iss 4, p 385 (2021)

Témata: CPS transformation, double negation translation, simply typed lambda-calculus, propositional logic, Curry-Howard isomorphism, Mathematics, QA1-939

Relation: https://www.mdpi.com/2227-7390/9/4/385; https://doaj.org/toc/2227-7390; https://doaj.org/article/12bea302e8594455af9bcd299b6d0484

Dostupnost: https://doi.org/10.3390/math9040385
https://doaj.org/article/12bea302e8594455af9bcd299b6d0484

Program Extraction from Normalization Proofs

Autoři: Berger, Ulrich Berghofer, Stefan Letouzey, Pierre a další

Zdroj: Studia Logica: An International Journal for Symbolic Logic, 2006 Feb 01. 82(1), 25-49.

Přístupová URL adresa: https://www.jstor.org/stable/20016766

Extensional proofs in a propositional logic modulo isomorphisms

Autoři: Alejandro Díaz-Caro Gilles Dowek

Zdroj: Theoretical Computer Science. 977:114172

Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, ISOMORPHISMS, SIMPLY TYPED LAMBDA CALCULUS, LOGIC, 03F05, 03B40, 03B38, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Logic in Computer Science (cs.LO)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2002.03762
http://hdl.handle.net/11336/249075

Monotone Majorizable Functionals

Autoři: Schwichtenberg, Helmut

Zdroj: Studia Logica: An International Journal for Symbolic Logic, 1999 Mar 01. 62(2), 283-289.

Přístupová URL adresa: https://www.jstor.org/stable/20016044

Proof Normalisation in a Logic Identifying Isomorphic Propositions

Autoři: Díaz-Caro, Alejandro Dowek, Gilles Alejandro Díaz-Caro and Gilles Dowek

Přispěvatelé: Díaz-Caro, Alejandro Dowek, Gilles Alejandro Díaz-Caro and Gilles Dowek

Témata: Simply typed lambda calculus, Isomorphisms, Logic, Cut-elimination, Proof-reduction

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 131, 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2019.14

Dostupnost: https://doi.org/10.4230/LIPIcs.FSCD.2019.14
https://nbn-resolving.org/urn:nbn:de:0030-drops-105210
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2019.14

A Generic Framework for Higher-Order Generalizations

Autoři: Cerna, David M. Kutsia, Temur David M. Cerna and Temur Kutsia

Přispěvatelé: Cerna, David M. Kutsia, Temur David M. Cerna and Temur Kutsia

Témata: anti-unification, typed lambda calculus, least general generalization

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 131, 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2019.10

Dostupnost: https://doi.org/10.4230/LIPIcs.FSCD.2019.10
https://nbn-resolving.org/urn:nbn:de:0030-drops-105175
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2019.10

Normal Higher-Order Termination

Autoři: Jouannaud, Jean Pierre Rubio Gimeno, Alberto Universitat Politècnica de Catalunya. Departament de Ciències de la Computació a další

Přispěvatelé: Jouannaud, Jean Pierre Rubio Gimeno, Alberto Universitat Politècnica de Catalunya. Departament de Ciències de la Computació a další

Zdroj: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname

Témata: typed lambda calculus, Typed lambda calculus, Lògica informàtica, Higher-order orderings, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], F42 [Grammars and Other Rewriting Systems] General Terms: Theory Additional Key Words and Phrases: Higher-order rewriting, Higher-order rewriting, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences, higher-order orderings, Computer logic, Informàtica::Informàtica teòrica [Àrees temàtiques de la UPC], 0202 electrical engineering, electronic engineering, information engineering, Categories and Subject Descriptors: F41 [Mathematical Logic]: Lambda calculus and related systems, higher-order patterns, Higher-order patterns, Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica

Popis souboru: application/pdf

Přístupová URL adresa: https://upcommons.upc.edu/bitstream/2117/79284/1/jouannaud-rubio_normal.pdf
http://hdl.handle.net/2117/79284
https://dl.acm.org/doi/10.1145/2699913
https://core.ac.uk/display/41822351
https://upcommons.upc.edu/bitstream/handle/2117/79284/jouannaud-rubio_normal.pdf;sequence=1
https://upcommons.upc.edu/bitstream/2117/79284/1/jouannaud-rubio_normal.pdf
https://upcommons.upc.edu/handle/2117/79284
https://hal.inria.fr/hal-01239068

Solving Textual Entailment with the Theorem Prover for Natural Language

Autoři: Abzianidze, L. LS Comp.semantiek en kunstm.intelligent. ILS LLI a další

Přispěvatelé: Abzianidze, L. LS Comp.semantiek en kunstm.intelligent. ILS LLI a další

Témata: Analytic tableau method, theorem proving, natural reasoning, lambda logical form, natural logic, typed lambda calculus, textual entailment, combinatory categorial grammar, Taverne

Popis souboru: application/pdf

Relation: https://dspace.library.uu.nl/handle/1874/410555

Dostupnost: https://dspace.library.uu.nl/handle/1874/410555

A Modern Elaboration of the Ramified Theory of Types

Autoři: Laan, Twan Nederpelt, Rob

Zdroj: Studia Logica: An International Journal for Symbolic Logic, 1996 Oct 01. 57(2/3), 243-278.

Přístupová URL adresa: https://www.jstor.org/stable/20015876