Results 51 to 60 of about 1,406,501 (313)

Circular Proofs as Session-Typed Processes: A Local Validity Condition [PDF]

open access: yesLogical Methods in Computer Science, 2022
Proof theory provides a foundation for studying and reasoning about programming languages, most directly based on the well-known Curry-Howard isomorphism between intuitionistic logic and the typed lambda-calculus.
Farzaneh Derakhshan, Frank Pfenning
doaj   +1 more source

Linear-use CPS translations in the Enriched Effect Calculus [PDF]

open access: yesLogical Methods in Computer Science, 2012
The enriched effect calculus (EEC) is an extension of Moggi's computational metalanguage with a selection of primitives from linear logic. This paper explores the enriched effect calculus as a target language for continuation-passing-style (CPS ...
Jeff Egger   +2 more
doaj   +1 more source

Matching Logic [PDF]

open access: yesLogical Methods in Computer Science, 2017
This paper presents matching logic, a first-order logic (FOL) variant for specifying and reasoning about structure by means of patterns and pattern matching.
Grigore Rosu
doaj   +1 more source

Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus [PDF]

open access: yesLogical Methods in Computer Science, 2017
We study an extension of Plotkin's call-by-value lambda-calculus via two commutation rules (sigma-reductions). These commutation rules are sufficient to remove harmful call-by-value normal forms from the calculus, so that it enjoys elegant ...
Giulio Guerrieri   +2 more
doaj   +1 more source

Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence [PDF]

open access: yesarXiv, 2023
We propose Pushdown Normal Form (PDNF) Bisimulation to verify contextual equivalence in higher-order functional programming languages with local state. Similar to previous work on Normal Form (NF) bisimulation, PDNF Bisimulation is sound and complete with respect to contextual equivalence.
arxiv  

A case of Beauveria bassiana keratitis confirmed by internal transcribed spacer and LSU rDNA D1–D2 sequencing

open access: yesNew Microbes and New Infections, EarlyView., 2014
Abstract We describe a case of fungal keratitis due to Beauveria bassiana in a farmer with Fuchs' dystrophy, treated with amphotericin B. Surgery with penetrating keratoplasty was necessary to resolve the lesions. Susceptibility testing and molecular sequencing permitted the identification and treatment of this rare aetiological agent of invasive ...
M. Ligozzi   +8 more
wiley   +1 more source

Early‐onset Alzheimer's disease shows a distinct neuropsychological profile and more aggressive trajectories of cognitive decline than late‐onset

open access: yesAnnals of Clinical and Translational Neurology, Volume 9, Issue 12, Page 1962-1973, December 2022., 2022
Abstract Objectives Early‐ and late‐onset Alzheimer's disease (EOAD and LOAD) share the same neuropathological traits but show distinct cognitive features. We aimed to explore baseline and longitudinal outcomes of global and domain‐specific cognitive function in a well characterized cohort of patients with a biomarker‐based diagnosis.
Adrià Tort‐Merino   +16 more
wiley   +1 more source

D-3.1-ECONOMIC ASSESSMENT AND STATUS OF UNITED PILOTS

open access: yes, 2021
The H2020 project UNITED aims to develop economically feasible offshore multi-use combinations for five pilots across European regional seas. The economic feasibility of multi-use combinations will be evaluated by a multi-criteria economic assessment framework.
openaire   +1 more source

The language of Stratified Sets is confluent and strongly normalising [PDF]

open access: yesLogical Methods in Computer Science, 2018
We study the properties of the language of Stratified Sets (first-order logic with $\in$ and a stratification condition) as used in TST, TZT, and (with stratifiability instead of stratification) in Quine's NF.
Murdoch J. Gabbay
doaj   +1 more source

A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems [PDF]

open access: yesLogical Methods in Computer Science, 2012
We give a method to prove confluence of term rewriting systems that contain non-terminating rewrite rules such as commutativity and associativity.
Takahito Aoto, Yoshihito Toyama
doaj   +1 more source

Home - About - Disclaimer - Privacy