• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium
  • 
    Type:
    
    • Article (24)
    • Book (5)
    • Miscellaneous (4)
  • 
    BLLDB-Access

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Page: 1 2 Hits 1 – 20 of 33 1 Verification of Program Transformations with Inductive Refinement Types Al-Sibahi, Ahmad,; Jensen, Thomas,; Dimovski, Aleksandar,... In: ISSN: 1049-331X ; ACM Transactions on Software Engineering and Methodology ; https://hal.inria.fr/hal-03518825 ; ACM Transactions on Software Engineering and Methodology, Association for Computing Machinery, 2021, 30 (1), pp.1-33. ⟨10.1145/3409805⟩ (2021) BASE Show details 2 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) 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 3 A Generic Framework for Symbolic Execution: a Coinductive Approach Lucanu, Dorel; Rusu, Vlad; Arusoaie, Andrei In: ISSN: 0747-7171 ; EISSN: 1095-855X ; Journal of Symbolic Computation ; https://hal.inria.fr/hal-01238696 ; Journal of Symbolic Computation, Elsevier, 2017, 80, pp.125-163. ⟨10.1016/j.jsc.2016.07.012⟩ (2017) BASE Show details 4 Quelques ponts entre sémantique opérationnelle et modèles dénotationnels des langages de programmation Hirschowitz, Tom. - : HAL CCSD, 2016 In: https://hal.archives-ouvertes.fr/tel-01400666 ; Logique en informatique [cs.LO]. Université Grenoble Alpes, 2016 (2016) BASE Show details 5 Dynamische Modellanalyse von Metamodellen mit operationaler Semantik Soden, Michael. - : Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2015 BASE Show details 6 Dynamische Modellanalyse von Metamodellen mit operationaler Semantik ... Soden, Michael. - : Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2015 BASE Show details 7 Operational Semantics of the Model of Concurrency and Communication Language Deantoni, Julien; Diallo, Papa Issa; Champeau, Joël... In: https://hal.inria.fr/hal-01060601 ; [Research Report] RR-8584, INRIA. 2014, pp.23 (2014) BASE Show details 8 Nested atomic sections with thread escape : semantics and compilation ; Sections atomiques emboîtées avec échappement de processus légers : sémantiques et compilation Pinsard, Thomas. - : HAL CCSD, 2014 In: https://tel.archives-ouvertes.fr/tel-01362118 ; Algorithme et structure de données [cs.DS]. Université d'Orléans, 2014. Français. ⟨NNT : 2014ORLE2075⟩ (2014) BASE Show details 9 Specifying and verifying program transformations with PTRANS Mansky, William. - 2014 BASE Show details 10 situ-f: a domain specific language and a first step towards the realization of situ framework Ming, Hua In: Graduate Theses and Dissertations (2012) BASE Show details 11 Formally Tracing Executions From an Analysis Tool Back to a Domain Specific Modeling Language's Operational Semantics Rusu, Vlad; Gonnord, Laure; Combemale, Benoit In: https://hal.inria.fr/inria-00526561 ; [Research Report] RR-7423, INRIA. 2010 (2010) BASE Show details 12 Rule Formats for Determinism and Idempotence Luca Aceto; Arnar Birgisson; Anna Ingolfsdottir... In: http://www.ru.is/faculty/luca/PAPERS/SCP-idempotence.pdf (2010) BASE Show details 13 Graph transformation systems in Constraint Handling Rules: improved methods for program analysis ... Raiser, Frank. - : Universität Ulm, 2010 BASE Show details 14 A semantics for behavior trees Colvin, Robert; Hayes, Ian J.. - 2010 BASE Show details 15 Peter, the Language that does not Exist. ; Peter, le langage qui n’existe pas. Liquori, Luigi. - : HAL CCSD, 2007 In: https://hal.inria.fr/tel-01148503 ; Computation and Language [cs.CL]. INPL - INP de LORRAINE, 2007 (2007) BASE Show details 16 Words Mean Things: What is the Decisive Point? Paquin, Albert J. In: DTIC (2007) BASE Show details 17 A Hierarchy of SOS Rule Formats Jan Friso Groote; MohammadReza Mousavi; Michel A. Reniers In: http://www.win.tue.nl/~mousavi/sos05_invited.pdf (2005) BASE Show details 18 A GH-Based Ontology to Support Applications for Automating Decision Support Loaiza, Francisco L.; Wartik, Steven P. In: DTIC (2005) BASE Show details 19 A Formal Syntax and Semantics for the GSPML Language McDermott, John P. In: DTIC AND NTIS (2005) BASE Show details 20 Semantics of the reFLect Language Sava Krstić; John Matthews In: http://www.cse.ogi.edu/~johnm/papers/KrsticMatthews_04.pdf (2004) BASE Show details Page: 1 2

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 33 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0