| 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)
|
|
Abstract:
International audience ; When proof assistants and theorem provers implement the metatheory of logical systems, they must deal with a range of syntactic expressions (e.g., types, formulas , and proofs) that involve variable bindings. Since most mature proof assistants do not have built-in methods to treat bindings, they have been extended with various packages and libraries that allow them to encode such syntax using, for example, de Bruijn numerals. We put forward the argument that bindings are such an intimate aspect of the structure of expressions that they should be accounted for directly in the underlying programming language support for proof assistants and not via packages and libraries. We present an approach to designing programming languages and proof assistants that directly supports bindings in syntax. The roots of this approach can be found in the mobility of binders between term-level bindings, formula-level bindings (quantifiers), and proof-level bindings (eigenvariables). In particular, the combination of Church's approach to terms and formulas (found in his Simple Theory of Types) and Gentzen's approach to proofs (found in his sequent calculus) yields a framework for the interaction of bindings with a full range of logical connectives and quantifiers. We will also illustrate how that framework provides a direct and semantically clean treatment of computation and reasoning with syntax containing bindings. Some implemented systems, which support this intimate and built-in treatment of bindings, will be briefly described.
|
|
Keyword:
[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]; [INFO]Computer Science [cs]; ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs; ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs/F.3.1.3: Mechanical verification; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.1: Computational logic; Mechanized metatheory; Mobility of binders; λ Tree syntax
|
|
URL: https://hal.inria.fr/hal-01884210/file/paper.pdf
https://hal.inria.fr/hal-01884210
https://doi.org/10.1007/s10817-018-9483-3
https://hal.inria.fr/hal-01884210/document
|
|
BASE
|
|
Hide 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)
|
|
BASE
|
|
Show details
|
|
|
| 19 |
NgramPOS: A Bigram-based Linguistic and Statistical Feature Process Model for Unstructured Text Classification
|
|
|
|
BASE
|
|
Show details
|
|
|
| 20 |
ПРОФЕССИОНАЛЬНО-ОРИЕНТИРОВАННОЕ ОБУЧЕНИЕ ИНОСТРАННОМУ ЯЗЫКУ МАГИСТРАНТОВ ТЕХНИЧЕСКИХ СПЕЦИАЛЬНОСТЕЙ
|
|
|
|
BASE
|
|
Show details
|
|
|
|
|
