Results 1 to 10 of about 2,457 (170)
Binary Lambda Calculus and Combinatory Logic [PDF]
, 2007 We introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-interpreters for these binary languages. We demonstrate their application to Algorithmic Information Theory with several concrete upper bounds on program-size complexity, including an elegant ...
Tromp, John
core +9 more sources
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 +4 more sources
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 +3 more sources
Addressing Machines as models of lambda-calculus [PDF]
Logical 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
COMBINATORY LOGIC AND $ lambda $-CALCULUS FOR CLASSICAL LOGIC [PDF]
Bulletin of informatics and cybernetics, 2000 Summary: Since Griffin's work in 1990, classical logic has been an attractive target for extracting computational contents. However, the classical principle used in Griffin's type system is the double-negation-elimination rule, which prevents one to analyze the intuitionistic part and the purely classical part separately. By formulating a calculus with
Baba, Kensuke +2 more
openaire +2 more sources
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
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
Counting and Generating Terms in the Binary Lambda Calculus (Extended version) [PDF]
, 2014 In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences.
Grygiel, Katarzyna, Lescanne, Pierre
core +7 more sources
Functional completeness of the mixed λ-calculus and combinatory logic
Theoretical Computer Science, 1990 The authors present a two-level version of combinatory logic and lambda calculus for distinguishing between early and late binding times, i.e. compile-time and run-time computations. In this paper, which is an extension of a previous one by the same authors, the two-level lambda calculus is enriched by a new combinator, \(\Psi\), which makes the ...
Nielson, Hanne Riis, Nielson, Flemming
openaire +2 more sources
Control Flow Analysis for SF Combinator Calculus
, 2015 Programs that transform other programs often require access to the internal structure of the program to be transformed. This is at odds with the usual extensional view of functional programming, as embodied by the lambda calculus and SK combinator ...
Lester, Martin
core +4 more sources