Search Results - ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS*
-
1
Authors: et al.
Contributors: et al.
Source: Logical Methods in Computer Science, Vol Volume 20, Issue 3 (2024)
Subject Terms: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Logic, [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], mathematics - dynamical systems, 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, 0102 computer and information sciences, Dynamical Systems (math.DS), 01 natural sciences, computer science - logic in computer science, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, FOS: Mathematics, mathematics - logic, Mathematics - Dynamical Systems, 0101 mathematics, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, mathematics - probability, BC1-199, Probability (math.PR), [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], QA75.5-76.95, Mathematics - Logic, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.4: Probabilistic computation, Logic in Computer Science (cs.LO), [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], Electronic computers. Computer science, Logic (math.LO), Mathematics - Probability
File Description: application/pdf
-
2
Authors: et al.
Contributors: et al.
Source: Lecture Notes in Computer Science ; Logic, Language, Information, and Computation ; https://hal.science/hal-05285182 ; Logic, Language, Information, and Computation, Jul 2025, Porto, Portugal. pp.175-193, ⟨10.1007/978-3-031-99536-1_11⟩
Subject Terms: Temporal Logic, Scott Domains, Refinement TYpes, 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.2: Semantics of Programming Languages, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, [INFO]Computer Science [cs]
Time: Porto, Portugal
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2502.11917; ARXIV: 2502.11917
-
3
Authors: et al.
Contributors: et al.
Source: https://hal.science/hal-02458330 ; 2023.
Subject Terms: ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.4: Probabilistic computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, 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, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2001.11906; info:eu-repo/grantAgreement//659920/EU/A Realizability Approach to Complexity Theory/ReACT; hal-02458330; https://hal.science/hal-02458330; https://hal.science/hal-02458330v5/document; https://hal.science/hal-02458330v5/file/Markov-Zeta2.pdf; ARXIV: 2001.11906
-
4
Authors: et al.
Contributors: et al.
Source: https://hal.science/hal-02895111 ; 2021.
Subject Terms: Models of Computation, Linear Logic, Semantics, Geometry of Interaction, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, 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, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2007.16077; ARXIV: 2007.16077
-
5
Authors: et al.
Contributors: et al.
Source: https://hal.science/hal-02458330 ; 2022.
Subject Terms: ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, 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.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.4: Probabilistic computation, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2001.11906; info:eu-repo/grantAgreement//659920/EU/A Realizability Approach to Complexity Theory/ReACT; hal-02458330; https://hal.science/hal-02458330; https://hal.science/hal-02458330v4/document; https://hal.science/hal-02458330v4/file/Markov-Zeta2.pdf; ARXIV: 2001.11906
-
6
Authors: et al.
Contributors: et al.
Source: https://hal.science/hal-02458358 ; 2023.
Subject Terms: ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.0: Automata (e.g., finite, push-down, resource-bounded), ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.4: Probabilistic computation, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.0: Complexity hierarchies, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.1: Machine-independent complexity, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, 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, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2002.00009; info:eu-repo/grantAgreement//659920/EU/A Realizability Approach to Complexity Theory/ReACT; ARXIV: 2002.00009
-
7
Authors: et al.
Contributors: et al.
Source: Electronic Proceedings in Theoretical Computer Science, Vol 292, Iss Proc. Linearity-TLLA 2018, Pp 104-117 (2019)
Subject Terms: Computer Science - Logic in Computer Science, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], QA75.5-76.95, 0102 computer and information sciences, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, 16. Peace & justice, 01 natural sciences, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], Electronic computers. Computer science, QA1-939, F.4.1, 0101 mathematics, Mathematics, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages
-
8
Authors: et al.
Contributors: et al.
Source: https://hal.archives-ouvertes.fr/hal-02458330 ; 2021.
Subject Terms: ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, 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.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.4: Probabilistic computation, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2001.11906; hal-02458330; https://hal.archives-ouvertes.fr/hal-02458330; https://hal.archives-ouvertes.fr/hal-02458330v3/document; https://hal.archives-ouvertes.fr/hal-02458330v3/file/MarkovZeta.pdf; ARXIV: 2001.11906
-
9
Authors: et al.
Contributors: et al.
Source: ENASE 2021 - 16th International Conference on Evaluation of Novel Approaches to Software Engineering ; https://hal.science/hal-03170814 ; ENASE 2021 - 16th International Conference on Evaluation of Novel Approaches to Software Engineering, Apr 2021, online, Czech Republic. pp.138-149, ⟨10.5220/0010462901380149⟩ ; https://enase.scitevents.org/?y=2021
Subject Terms: BPMN, Timed Models, Workflows, Collaborations, Formal Verification, Alloy, ACM: H.: Information Systems, 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, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]
Subject Geographic: online, Czech Republic
-
10
Authors: et al.
Contributors: et al.
Source: Journal of Automated Reasoning. 63:625-665
Subject Terms: ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.1: Computational logic, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], λ Tree syntax, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 02 engineering and technology, [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, 01 natural sciences, Mechanized metatheory, Mobility of binders, 0202 electrical engineering, electronic engineering, information engineering, [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/F.3.1.3: Mechanical verification
File Description: application/pdf
Access URL: https://hal.inria.fr/hal-01884210/file/paper.pdf
https://jglobal.jst.go.jp/detail?JGLOBAL_ID=201902226179407667
https://link.springer.com/article/10.1007/s10817-018-9483-3
https://dblp.uni-trier.de/db/journals/jar/jar63.html#Miller19
https://hal.inria.fr/hal-01884210/document
https://hal.inria.fr/hal-01884210 -
11
Authors: et al.
Contributors: et al.
Source: ACM Transactions on Computational Logic. 19:1-24
Subject Terms: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], FOS: Computer and information sciences, Computer Science - Logic in Computer Science, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.3: Decision problems, recursive sets), 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.1: Classes defined by grammars or automata (e.g, resource-bounded), 03D15, 68Q15, 68Q55, 03D05, 03B47, 03F52, push-down, FOS: Mathematics, finite, 0101 mathematics, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.0: Automata (e.g, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, context-free languages, regular sets, F.3.2, F.4.1, F.4.3, F.1.3, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Mathematics - Logic, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.0: Complexity hierarchies, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.1: Machine-independent complexity, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, Logic in Computer Science (cs.LO), [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], Computer Science - Computational Complexity, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.0: Alternation and nondeterminism, Logic (math.LO)
-
12
Authors: et al.
Contributors: et al.
Source: Acta Informatica. 56:385-389
Subject Terms: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], Computer Science - Programming Languages, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], MSC 68Q17 68Q60 03D80 03D35 03D25 03B35, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.2: Correctness proofs, 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.1: Invariants, Programming Languages (cs.PL), Logic in Computer Science (cs.LO)
Access URL: http://arxiv.org/pdf/1709.04382
http://arxiv.org/abs/1709.04382
https://arxiv.org/abs/1709.04382
https://link.springer.com/article/10.1007/s00236-018-0324-y
https://dblp.uni-trier.de/db/journals/corr/corr1709.html#abs-1709-04382
https://link.springer.com/content/pdf/10.1007%2Fs00236-018-0324-y.pdf
http://arxiv.org/pdf/1709.04382.pdf
https://hal.archives-ouvertes.fr/hal-01587125 -
13
Authors: et al.
Contributors: et al.
Source: Lecture Notes in Computer Science ISBN: 9783319492582
Subject Terms: [INFO.INFO-DC]Computer Science [cs]/Distributed, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.0: Complexity of proof procedures, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], ACM: D.: Software/D.4: OPERATING SYSTEMS/D.4.5: Reliability/D.4.5.2: Fault-tolerance, Parallel, 01 natural sciences, and Cluster Computing [cs.DC], ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.1: Computations on discrete structures, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems/C.2.4.1: Distributed applications, [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/F.3.1.3: Mechanical verification, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.3: Studies of Program Constructs/F.3.3.4: Type structure
File Description: application/pdf
Access URL: https://link.springer.com/article/10.1007/s00224-017-9828-z
https://hal.archives-ouvertes.fr/hal-01894618
https://doi.org/10.1007/s00224-017-9828-z
https://dblp.uni-trier.de/db/journals/mst/mst63.html#BalabonskiDRTU19
https://rd.springer.com/chapter/10.1007/978-3-319-49259-9_2
https://doi.org/10.1007/978-3-319-49259-9_2
https://hal.archives-ouvertes.fr/hal-01491813
https://dblp.uni-trier.de/db/conf/sss/sss2016.html#BalabonskiDRTU16
https://link.springer.com/chapter/10.1007/978-3-319-49259-9_2
http://dblp.uni-trier.de/db/conf/sss/sss2016.html#BalabonskiDRTU16
https://hal.science/hal-01894618v1/document
https://doi.org/10.1007/s00224-017-9828-z
https://hal.science/hal-01894618v1
https://hal.sorbonne-universite.fr/hal-01491813v1
https://doi.org/10.1007/978-3-319-49259-9_2 -
14
Authors:
Contributors:
Source: https://hal.science/hal-02977750 ; 2022.
Subject Terms: Models of Computation, Linear Logic, Semantics, Geometry of Interaction, Realizability semantics, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, 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, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2012.04752; ARXIV: 2012.04752
-
15
Authors: et al.
Contributors: et al.
Source: Journal of Applied Logic. 12:28-44
Subject Terms: Martin-Löf identity type, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], [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.1: Specifying and Verifying and Reasoning about Programs/F.3.1.2: Logics of programs, 0102 computer and information sciences, 16. Peace & justice, path object, 01 natural sciences, Martin-Löf type theory, Grothendieck Fibration, 0101 mathematics, homotopical type theory
File Description: application/pdf
Access URL: https://inria.hal.science/hal-00706562v4/document
https://inria.hal.science/hal-00706562v4
https://doi.org/10.1016/j.jal.2013.08.003
https://www.sciencedirect.com/science/article/abs/pii/S157086831300061X
https://hal.inria.fr/hal-00706562
https://dblp.uni-trier.de/db/journals/japll/japll12.html#Lamarche14
https://www.sciencedirect.com/science/article/pii/S157086831300061X
https://www.sciencedirect.com/science/article/pii/S157086831300061X#! -
16
Authors: et al.
Contributors: et al.
Source: https://hal.archives-ouvertes.fr/hal-02458330 ; 2020.
Subject Terms: ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, 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.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.4: Probabilistic computation, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2001.11906; hal-02458330; https://hal.archives-ouvertes.fr/hal-02458330; https://hal.archives-ouvertes.fr/hal-02458330v2/document; https://hal.archives-ouvertes.fr/hal-02458330v2/file/Markov-Zeta-short.pdf; ARXIV: 2001.11906
-
17
Authors: et al.
Contributors: et al.
Source: 26th EACSL Annual Conference on Computer Science Logic (CSL 2017)
https://inria.hal.science/hal-01579271
26th EACSL Annual Conference on Computer Science Logic (CSL 2017), Aug 2017, Stockholm, Sweden. pp.8:1 - 8:16, ⟨10.4230/LIPIcs.CSL.2017.8⟩Subject Terms: Categorical Semantics, Type Theory, Univalence Axiom, 1998 ACM Subject Classification F.3.2 Semantics of Programming Languages, F.4.1 Mathematical Logic, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, [INFO]Computer Science [cs], [MATH]Mathematics [math]
Time: Stockholm, Sweden
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1705.04310; info:eu-repo/grantAgreement//637339/EU/Coq for Homotopy Type Theory/CoqHoTT; ARXIV: 1705.04310
-
18
Authors: et al.
Contributors: et al.
Source: 13th international Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
https://inria.hal.science/hal-01806129
13th international Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, Jul 2018, Oxford, United KingdomSubject Terms: ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.3: Studies of Program Constructs/F.3.3.1: Functional constructs, 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, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Subject Geographic: Oxford, United Kingdom
-
19
Authors: et al.
Contributors: et al.
Source: Journal of Logical and Algebraic Methods in Programming. 92:45-63
Subject Terms: ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, [INFO.INFO-DC]Computer Science [cs]/Distributed, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Semantics of Programming Langages, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 16. Peace & justice, ACM: F.: Theory of Computation, Parallel, 01 natural sciences, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, Soft Constraints, and Cluster Computing [cs.DC], Soft Concurrent Constraint Programming, Bisimulation, 13. Climate action, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Concurrent Constraint Programming, 0101 mathematics
Access URL: https://inria.hal.science/hal-01675060v1
https://doi.org/10.1016/j.jlamp.2017.06.001
https://www.sciencedirect.com/science/article/pii/S2352220817301165
https://core.ac.uk/display/87081999
https://hal.inria.fr/hal-01675060
https://research.unipg.it/handle/11391/1417231
https://dblp.uni-trier.de/db/journals/jlp/jlp92.html#GadducciSPV17
https://hdl.handle.net/11568/872080
https://doi.org/10.1016/j.jlamp.2017.06.001
http://www.sciencedirect.com/science/journal/23522208
https://doi.org/10.1016/j.jlamp.2017.06.001
https://hdl.handle.net/11391/1417231 -
20
Authors: et al.
Contributors: et al.
Source: LICS 2018 - 33th Annual ACM/IEEE Symposium on Logic in Computer Science ; https://inria.hal.science/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⟩
Subject Terms: sequent calculus, classical arithmetic, Curry-Howard, classical realizability, side effects, dependent choice, dependent types, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, 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.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, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Subject Geographic: Oxford, United Kingdom
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1805.09542; ARXIV: 1805.09542
Full Text Finder 
Nájsť tento článok vo Web of Science