Results 1 to 10 of about 13,083 (112)
On the Relation of Interaction Semantics to Continuations and Defunctionalization [PDF]
Logical Methods in Computer Science, 2014 In game semantics and related approaches to programming language semantics, programs are modelled by interaction dialogues. Such models have recently been used in the design of new compilation methods, e.g.
Ulrich Schöpp
doaj +5 more sources
Control Flow Analysis for SF Combinator Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 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 ...
Martin Lester
doaj +4 more sources
Differentials and distances in probabilistic coherence spaces [PDF]
Logical Methods in Computer Science, 2022 In probabilistic coherence spaces, a denotational model of probabilistic functional languages, morphisms are analytic and therefore smooth. We explore two related applications of the corresponding derivatives.
Thomas Ehrhard
doaj +1 more source
Logical Methods in Computer Science, 2020 The main scientific heritage of Corrado B\"ohm consists of ideas about computing, concerning concrete algorithms, as well as models of computability. The following will be presented. 1. A compiler that can compile itself. 2.
Henk P. Barendregt
doaj +1 more source
Typing weak MSOL properties [PDF]
Logical Methods in Computer Science, 2017 We consider lambda-Y-calculus as a non-interpreted functional programming language: the result of the execution of a program is its normal form that can be seen as the tree of calls to built-in operations.
Sylvain Salvati, Igor Walukiewicz
doaj +1 more source
Bistable Biorders: A Sequential Domain Theory [PDF]
Logical Methods in Computer Science, 2007 We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order -- the extensional order -- and a bistable coherence, which captures equivalence ...
James Laird
doaj +1 more source
A Theorem Prover for Scientific and Educational Purposes [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We present a prototype of an integrated reasoning environment for educational purposes. The presented tool is a fragment of a proof assistant and automated theorem prover.
Mario Frank, Christoph Kreitz
doaj +1 more source
Repetitive Reduction Patterns in Lambda Calculus with letrec (Work in Progress) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 For the lambda-calculus with letrec we develop an optimisation, which is based on the contraction of a certain class of 'future' (also: virtual) redexes.
Jan Rochel, Clemens Grabmayer
doaj +1 more source
First Class Call Stacks: Exploring Head Reduction [PDF]
, 2016 Weak-head normalization is inconsistent with functional extensionality in the call-by-name $\lambda$-calculus. We explore this problem from a new angle via the conflict between extensionality and effects.
Ariola, Zena M. +2 more
core +2 more sources
Chemical concrete machine [PDF]
, 2013 The chemical concrete machine is a graph rewriting system which uses only local moves (rewrites), seen as chemical reactions involving molecules which are graphs made up by 4 trivalent nodes.
Buliga, Marius
core +2 more sources