Home Catalogue search

eng

Refine your search:

Search in the Catalogues and Directories






	Sort by
Simple Search

Page: 1 2 3 4

Hits 1 – 20 of 61

1	A gentle introduction to Girard's Transcendental Syntax for the linear logician
	Eng, Boris
	In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2022 (2022)
	BASE
	Show details

2	Multiplicative Linear Logic from Logic Programs and Tilings
	Eng, Boris; Seiller, Thomas
	In: https://hal.archives-ouvertes.fr/hal-02895111 ; 2021 (2021)
	BASE
	Show details

3	A gentle introduction to Girard's Transcendental Syntax for the linear logician
	Eng, Boris
	In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
	BASE
	Show details

4	Stellar Resolution: Multiplicatives - for the linear logician, through examples
	Eng, Boris
	In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
	BASE
	Show details

5	A gentle introduction to Girard's Transcendental Syntax for the linear logician
	Eng, Boris
	In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
	BASE
	Show details

6	Stellar Resolution: Multiplicatives - for the linear logician, through examples
	Eng, Boris
	In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
	BASE
	Show details

7	Type-logical investigations: proof-theoretic, computational and linguistic aspects of modern type-logical grammars
	Moot, Richard. - : HAL CCSD, 2021
	In: https://hal-lirmm.ccsd.cnrs.fr/tel-03452731 ; Computation and Language [cs.CL]. Université Montpellier, 2021 (2021)
	BASE
	Show details

8	Proofs as games and games as proofs: dialogical semantics for logic and natural language. ; Les preuves vues comme des jeux et réciproquement : sémantique dialogique de langages naturels ou logiques.
	Catta, Davide. - : HAL CCSD, 2021
	In: https://tel.archives-ouvertes.fr/tel-03553000 ; Logic in Computer Science [cs.LO]. Université de Montpellier, 2021. English (2021)
	BASE
	Show details

9	Proofs as games and games as proofs : dialogical semantics of logical and natural languages ; Les preuves vues comme des jeux et réciproquement : sémantique dialogique de langages naturel ou logiques
	Catta, Davide. - : HAL CCSD, 2021
	In: https://tel.archives-ouvertes.fr/tel-03588308 ; Informatique et langage [cs.CL]. Université Montpellier, 2021. Français. ⟨NNT : 2021MONTS064⟩ (2021)
	BASE
	Show details

10	Proofs as games and games as proofs: dialogical semantics for logic and natural language. ; Les preuves vues comme des jeux et réciproquement : sémantique dialogique de langages naturels ou logiques.
	Catta, Davide. - : HAL CCSD, 2021
	In: https://tel.archives-ouvertes.fr/tel-03553000 ; Logic in Computer Science [cs.LO]. Université de Montpellier, 2021. English (2021)
	BASE
	Show details

11	Proof-theoretic aspects of NLλ
	Moot, Richard
	In: https://hal-lirmm.ccsd.cnrs.fr/lirmm-02973980 ; 2020 (2020)
	BASE
	Show details

12	Towards Higher-Order Abstract Syntax in Cedille (Work in Progress)
	Stump, Aaron
	In: LFMTP 2019 Logical Frameworks and Meta-Languages: Theory and Practice 2019 ; https://hal.archives-ouvertes.fr/hal-02152417 ; LFMTP 2019 Logical Frameworks and Meta-Languages: Theory and Practice 2019, Jun 2019, Vancouver, Canada (2019)
	Abstract: International audience ; Cedille is a relatively recent tool based on a Curry-style pure type theory, without a primitive datatype system. Using novel techniques based on dependent intersection types, inductive datatypes with their induction principles are derived. One benefit of this approach is that it allows exploration of new or advanced forms of inductive datatypes. This paper reports work in progress on one such form, namely higher-order abstract syntax (HOAS). We consider the nature of HOAS in the setting of pure type theory, comparing with the traditional concept of environment models for lambda calculus. We see an alternative, based on what we term Kripke function-spaces, for which Cedille confirms we have a weakly initial algebra. Progress extending this to support dependent elimination is described.
	Keyword: [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.4: Mechanical theorem proving; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory
	URL: https://hal.archives-ouvertes.fr/hal-02152417 https://hal.archives-ouvertes.fr/hal-02152417/file/LFMTP2019_SP_2.pdf https://hal.archives-ouvertes.fr/hal-02152417/document
	BASE
	Hide details

13	A sequent calculus with dependent types for classical arithmetic
	Miquey, Étienne
	In: LICS 2018 - 33th Annual ACM/IEEE Symposium on Logic in Computer Science ; https://hal.inria.fr/hal-01703526 ; LICS 2018 - 33th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2018, Oxford, United Kingdom. pp.720-729, ⟨10.1145/3209108.3209199⟩ (2018)
	BASE
	Show details

14	From logical and linguistic generics to Hilbert’s tau and epsilon quantifiers
	Chatzikyriakidis, Stergios; Pasquali, Fabio; Retoré, Christian
	In: ISSN: 2055-3706 ; IfColog Journal of Logics and their Applications (FLAP) ; https://hal.archives-ouvertes.fr/hal-01803717 ; IfColog Journal of Logics and their Applications (FLAP), College Publications, 2017, Hilbert’s epsilon and tau in Logic, Informatics and Linguistics, 4 (2), pp.231-256 ; http://www.collegepublications.co.uk/downloads/ifcolog00011.pdf (2017)
	BASE
	Show details

15	Logic-based argumentation with existential rules
	Arioua, Abdallah; Croitoru, Madalina; Vesic, Srdjan
	In: ISSN: 0888-613X ; International Journal of Approximate Reasoning ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01596666 ; International Journal of Approximate Reasoning, Elsevier, 2017, 90, pp.76-106. ⟨10.1016/j.ijar.2017.07.004⟩ (2017)
	BASE
	Show details

16	Proof, rigour and informality : a virtue account of mathematical knowledge
	Tanswell, Fenner Stanley. - : University of St Andrews, 2017. : The University of St Andrews, 2017. : University of Stirling, 2017
	BASE
	Show details

17	Formalizing Abstract Computability: Turing Categories in Coq
	Vinogradova, Polina. - : Université d'Ottawa / University of Ottawa, 2017
	BASE
	Show details

18	Focused and Synthetic Nested Sequents (Extended Technical Report)
	Chaudhuri, Kaustuv; Marin, Sonia; Straßburger, Lutz
	In: https://hal.inria.fr/hal-01251722 ; [Research Report] Inria. 2016 (2016)
	BASE
	Show details

19	A Dialectical Proof Theory for Universal Acceptance in Coherent Logic-based Argumentation Frameworks
	Arioua, Abdallah; Croitoru, Madalina
	In: 22nd European Conference on Artificial Intelligence ; ECAI : European Conference on Artificial Intelligence ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01333368 ; ECAI : European Conference on Artificial Intelligence, Aug 2016, The Hague, Netherlands. pp.55-63, ⟨10.3233/978-1-61499-672-9-55⟩ ; http://www.ecai2016.org/ (2016)
	BASE
	Show details

20	Comparing and evaluating extended Lambek calculi
	Moot, Richard
	In: Empirical advances in categorial grammars ; https://hal.archives-ouvertes.fr/hal-01164670 ; Empirical advances in categorial grammars, Yusuke Kubota and Robert Levine, Aug 2015, Barcelona, Spain (2015)
	BASE
	Show details

Page: 1 2 3 4

© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern