Results 1 to 10 of about 549 (97)

Semantics for Combinatory Logic With Intersection Types

open access: yesFrontiers in Computer Science, 2022
There is a plethora of semantics of computational models, nevertheless, the semantics of combinatory logic are among the less investigated ones. In this paper, we propose semantics for the computational system of combinatory logic with intersection types.
Silvia Ghilezan   +2 more
doaj   +3 more sources

Adapting Logic to Physics: The Quantum-Like Eigenlogic Program [PDF]

open access: yesEntropy, 2020
Considering links between logic and physics is important because of the fast development of quantum information technologies in our everyday life. This paper discusses a new method in logic inspired from quantum theory using operators, named Eigenlogic ...
Zeno Toffano, François Dubois
doaj   +2 more sources

How Combinatory Logic Can Limit Computing Complexity [PDF]

open access: yesEPJ Web of Conferences, 2020
As computing capabilities are extending, the amount of source code to manage is inevitably becoming larger and more complex. No matter how hard we try, the bewildering complexity of the source code always ends up overwhelming its own creator, to the ...
Bergier Hugolin
doaj   +1 more source

Addressing Machines as models of lambda-calculus [PDF]

open access: yesLogical Methods in Computer Science, 2022
Turing machines and register machines have been used for decades in theoretical computer science as abstract models of computation. Also the $\lambda$-calculus has played a central role in this domain as it allows to focus on the notion of functional ...
Giuseppe Della Penna   +2 more
doaj   +1 more source

Classical Combinatory Logic [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2005
Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages.
Karim Nour
doaj   +1 more source

Are there Hilbert-style Pure Type Systems? [PDF]

open access: yesLogical Methods in Computer Science, 2008
For many a natural deduction style logic there is a Hilbert-style logic that is equivalent to it in that it has the same theorems (i.e. valid judgements with empty contexts).
M. W. Bunder, W. M. J. Dekkers
doaj   +1 more source

CLS-SMT: Bringing Together Combinatory Logic Synthesis and Satisfiability Modulo Theories [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2019
We introduce an approach that aims to combine the usage of satisfiability modulo theories (SMT) solvers with the Combinatory Logic Synthesizer (CL)S framework.
Fadil Kallat   +2 more
doaj   +1 more source

Implementing Natural Language Inference for comparatives

open access: yesJournal of Language Modelling, 2023
This paper presents a computational framework for Natural Language Inference (NLI) using logic-based semantic representations and theorem-proving. We focus on logical inferences with comparatives and other related constructions in English, which are ...
Izumi Haruta   +2 more
doaj   +1 more source

A Forgotten Theory of Proofs ? [PDF]

open access: yesLogical Methods in Computer Science, 2019
Looking at MacLane's thesis on proof theory in the light of combinatory ...
Erwin Engeler
doaj   +1 more source

Using Inhabitation in Bounded Combinatory Logic with Intersection Types for Composition Synthesis [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2013
We describe ongoing work on a framework for automatic composition synthesis from a repository of software components. This work is based on combinatory logic with intersection types.
Boris Düdder   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy