Results 11 to 20 of about 697,012 (268)
CoRR, 2022 We develop a classical propositional logic for reasoning about combinatory logic. We define its syntax, axiomatic system and semantics. The syntax and axiomatic system are presented based on classical propositional logic, with typed combinatory terms as ...
Kašterović, Simona, Ghilezan, Silvia
core +4 more sources
Bounded Combinatory Logic [PDF]
, 2012 In combinatory logic one usually assumes a fixed set of basic combinators (axiom schemes), usually K and S. In this setting the set of provable formulas (inhabited types) is PSPACE-complete in simple types and undecidable in intersection types.
Urzyczyn, Pawel +3 more
core +5 more sources
Mathematical Structures in Computer Science, 2006 The lambda-calculus is destructive: its main computational mechanism, beta reduction, destroys the redex, which makes replaying the computational steps impossible.
Wiklicky H. +2 more
core +6 more sources
Extension of combinatory logic to a theory of combinatory representation [PDF]
Theoretical Computer Science, 1992 In theoretical computer science and mathematics the models of combinatory logic are of significance in various ways. In particular within the discipline algebra, varieties are represented in the graph models of Engeler using some set of equations.
Weibel, Trudy
core +4 more sources
Intersection types for combinatory logic [PDF]
Theoretical Computer Science, 1992 Two different translations of the usual formulation of intersection types for λ-calculus into combinatory logic are proposed; in the first one the rule (⩽) is unchanged, while in the second one the rule (⩽) is replaced by three new rules and four axiom ...
J.Roger Hindley +3 more
core +4 more sources
Inductive synthesis of logic programs by composition of combinatory program schemes
, 1999 Based on a variable-free combinatory form of definite clause logic programs we outline a methodology and supporting program environment COMBINDUCE for inducing well-moded logic programs from examples.
Nilsson, Jorgen Fischer. +1 more
core +9 more sources
User Support for the Combinator Logic Synthesizer Framework [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 Usability is crucial for the adoption of software development technologies. This is especially true in development stages, where build processes fail, because software is not yet complete or was incompletely modified.
Jan Bessai, Anna Vasileva
doaj +1 more source
Equipotential Space in Housing as a Strategy for Adaptability
Materia Arquitectura, 2021 Architecture must provide answers, in the domestic realm, to the constant and vertiginous change in contemporary society’s needs and lifestyles. For this reason, we propose to examine the concept of 'adaptability' in housing based on the study of a ...
José Luis Bezos Alonso
doaj +1 more source
Derivation Lengths Classification of G\"odel's T Extending Howard's Assignment [PDF]
Logical Methods in Computer Science, 2012 Let T be Goedel's system of primitive recursive functionals of finite type in the lambda formulation. We define by constructive means using recursion on nested multisets a multivalued function I from the set of terms of T into the set of natural numbers ...
Gunnar Wilken, Andreas Weiermann
doaj +1 more source
Asymptotically almost all \lambda-terms are strongly normalizing [PDF]
Logical Methods in Computer Science, 2013 We present quantitative analysis of various (syntactic and behavioral) properties of random \lambda-terms. Our main results are that asymptotically all the terms are strongly normalizing and that any fixed closed term almost never appears in a random ...
René David +5 more
doaj +1 more source