| 1 |
A gentle introduction to Girard's Transcendental Syntax for the linear logician
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2022 (2022)
|
|
BASE
|
|
Show details
|
|
|
| 2 |
Unsupervised Morphological Segmentation and Part-of-Speech Tagging for Low-Resource Scenarios
|
|
|
|
BASE
|
|
Show details
|
|
|
| 3 |
Salience Estimation and Faithful Generation: Modeling Methods for Text Summarization and Generation
|
|
|
|
BASE
|
|
Show details
|
|
|
| 4 |
Multiplicative Linear Logic from Logic Programs and Tilings
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02895111 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 5 |
A gentle introduction to Girard's Transcendental Syntax for the linear logician
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 6 |
Stellar Resolution: Multiplicatives - for the linear logician, through examples
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 7 |
A gentle introduction to Girard's Transcendental Syntax for the linear logician
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 8 |
Stellar Resolution: Multiplicatives - for the linear logician, through examples
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 10 |
Unsupervised Morphological Segmentation and Part-of-Speech Tagging for Low-Resource Scenarios ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 11 |
History of Logo
|
|
|
|
In: Proceedings of the ACM on Programming Languages, vol 4, iss HOPL (2020)
|
|
BASE
|
|
Show details
|
|
|
| 12 |
Preventing Summer Reading Slide: Examining the Effects of Two Computer-Assisted Reading Programs
|
|
|
|
In: ETSU Faculty Works (2020)
|
|
BASE
|
|
Show details
|
|
|
| 13 |
A call for cautious interpretation of meta-analytic reviews
|
|
|
|
In: Education Publications (2020)
|
|
BASE
|
|
Show details
|
|
|
| 14 |
Mechanized metatheory revisited
|
|
|
|
In: ISSN: 0168-7433 ; EISSN: 1573-0670 ; Journal of Automated Reasoning ; https://hal.inria.fr/hal-01884210 ; Journal of Automated Reasoning, Springer Verlag, 2019, 63 (3), pp.625-665. ⟨10.1007/s10817-018-9483-3⟩ (2019)
|
|
BASE
|
|
Show details
|
|
|
| 15 |
Decidable XPath Fragments in the Real World
|
|
|
|
In: 38th ACM Symposium on Principles of Database Systems (PODS'19) ; https://hal.inria.fr/hal-01852475 ; 38th ACM Symposium on Principles of Database Systems (PODS'19), 2019, Amsterdam, Netherlands. ⟨10.1145/3294052.3319685⟩ (2019)
|
|
BASE
|
|
Show details
|
|
|
| 16 |
Primärprozess in der Katathym Imaginativen Psychotherapie unter dem Einfluss psychotroper Substanzen ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 17 |
The Manifesto Corpus: a new resource for research on political parties and quantitative text analysis
|
|
|
|
In: Research and Politics ; 3 ; 2 ; 1-8 (2019)
|
|
BASE
|
|
Show details
|
|
|
| 18 |
A sequent calculus with dependent types for classical arithmetic
|
|
|
|
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)
|
|
Abstract:
International audience ; In a recent paper, Herbelin developed a calculus dPA$^\omega$ in which constructive proofs for the axioms of countable and dependent choices could be derived via the encoding of a proof of countable universal quantification as a stream of it components. However, the property of normalization (and therefore the one of soundness) was only conjectured. The difficulty for the proof of normalization is due to the simultaneous presence of dependent dependent types (for the constructive part of the choice), of control operators (for classical logic), of coinductive objects (to encode functions of type $\mathbb{N} \to A$ into streams $(a_0,a_1,\ldots)$) and of lazy evaluation with sharing (for these coinductive objects).Building on previous works, we introduce in this paper a variant of dPA$^\omega$ presented as a sequent calculus. On the one hand, we take advantage of a variant of Krivine classical realizability we developed to prove the normalization of classical call-by-need. On the other hand, we benefit of dL, a classical sequent calculus with dependent types in which type safety is ensured using delimited continuations together with a syntactic restriction. By combining the techniques developed in these papers, we manage to define a realizability interpretation à la Krivine of our calculus that allows us to prove normalization and soundness.
|
|
Keyword:
[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]; ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.2: Operational semantics; ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.3: Studies of Program Constructs/F.3.3.0: Control primitives; 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.7: Proof theory; classical arithmetic; classical realizability; Curry-Howard; dependent choice; dependent types; sequent calculus; side effects
|
|
URL: https://hal.inria.fr/hal-01703526v2/file/dlpaw.pdf
https://hal.inria.fr/hal-01703526v2/document
https://doi.org/10.1145/3209108.3209199
https://hal.inria.fr/hal-01703526
|
|
BASE
|
|
Hide details
|
|
|
| 19 |
NgramPOS: A Bigram-based Linguistic and Statistical Feature Process Model for Unstructured Text Classification
|
|
|
|
BASE
|
|
Show details
|
|
|
| 20 |
ПРОФЕССИОНАЛЬНО-ОРИЕНТИРОВАННОЕ ОБУЧЕНИЕ ИНОСТРАННОМУ ЯЗЫКУ МАГИСТРАНТОВ ТЕХНИЧЕСКИХ СПЕЦИАЛЬНОСТЕЙ
|
|
|
|
BASE
|
|
Show details
|
|
|
|
|
