Results 21 to 30 of about 697,012 (268)
CLEI Electronic Journal, 2023 This work presents an interactive proof assistant, based on Dijkstra-Scholten logic, aimed at teaching logic and discrete mathematics in higher education.
Federico Flaviani, Walter Carballosa
doaj +1 more source
Compilation of combinatory reduction systems [PDF]
, 1993 Combinatory Reduction Systems generalise Term Rewriting Systems. They are powerful enough to express β-reduction of λ-calculus as a single rewrite rule. The additional expressive power has its price — CRSs are much harder to implement than ordinary TRSs.
Stefan Kahrs, Kahrs, Stefan
core +1 more source
NP-Completeness of Combinator Optimisation Problem [PDF]
, 1995 We consider a deterministic rewrite system for combinatory logic over combinators S, K, I, B, C, S’, B’ and C’. Terms will be represented by graphs so that reduction of a duplicator will cause the duplicated to be "shared" rather than copied.
Rayward-Smith, V. J. +2 more
core +1 more source
Undecidability of Equality in the Free Locally Cartesian Closed Category (Extended version) [PDF]
Logical Methods in Computer Science, 2017 We show that a version of Martin-L\"of type theory with an extensional identity type former I, a unit type N1 , Sigma-types, Pi-types, and a base type is a free category with families (supporting these type formers) both in a 1- and a 2-categorical sense.
Simon Castellan +2 more
doaj +1 more source
Encoding the Factorisation Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Jay and Given-Wilson have recently introduced the Factorisation (or SF-) calculus as a minimal fundamental model of intensional computation. It is a combinatory calculus containing a special combinator, F, which is able to examine the internal structure ...
Reuben N. S. Rowe
doaj +1 more source
A Semantic Approach to Illative Combinatory Logic [PDF]
, 2011 This work introduces the theory of illative combinatory algebras, which is closely related to systems of illative combinatory logic. We thus provide a semantic interpretation for a formal framework in which both logic and computation may be expressed
Czajka, Lukasz
core +1 more source
Mixin Composition Synthesis based on Intersection Types [PDF]
Logical Methods in Computer Science, 2018 We present a method for synthesizing compositions of mixins using type inhabitation in intersection types. First, recursively defined classes and mixins, which are functions over classes, are expressed as terms in a lambda calculus with records ...
Jan Bessai +5 more
doaj +1 more source
Partial Combinatory Algebras of Functions [PDF]
, 2011 We employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J.
Sub Algebra,Geometry&Mathem. Logic begr. +3 more
core +2 more sources
Antecedentes griegos y medievales del cálculo lógico
Tópicos, 2013 Aristotle's sylogistics shows some precedents of the logical formalism as a deductive-axiomatic system that employs the notions of implication and validity, besides using variables for the terms.
Mauricio Beuchot P.
doaj +1 more source
RPO, Second-order Contexts, and Lambda-calculus [PDF]
Logical Methods in Computer Science, 2009 First, we extend Leifer-Milner RPO theory, by giving general conditions to obtain IPO labelled transition systems (and bisimilarities) with a reduced set of transitions, and possibly finitely branching.
Pietro Di Gianantonio +2 more
doaj +1 more source