Results 21 to 30 of about 13,083 (112)

ASMs and Operational Algorithmic Completeness of Lambda Calculus [PDF]

, 2010
We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype.
A. Church, A. Church, A.J. Atrubin, A.N. Kolmogorov, D. Knuth, E. Börger, E. Börger, F.C. Hennie, H. Barendregt, H. Curry, H.P. Barendregt, J.L. Krivine, N. Dershowitz, R. Statman, S. Ronchi Della Rocca, T. Mogensen, W. Paul, Y. Gurevich, Y. Gurevich   +18 more
core   +4 more sources

Lambda Calculus for Engineers [PDF]

, 2007
In pure functional programming it is awkward to use a stateful sub-computation in a predominantly stateless computation. The problem is that the state of the subcomputation has to be passed around using ugly plumbing.
Hartel, P.H., Vree, W.G.
core   +1 more source

Logical relations for coherence of effect subtyping

, 2018
A coercion semantics of a programming language with subtyping is typically defined on typing derivations rather than on typing judgments. To avoid semantic ambiguity, such a semantics is expected to be coherent, i.e., independent of the typing derivation
Biernacki, Dariusz, Polesiuk, Piotr
core   +1 more source

Interpreter za \(\lambda\)-račun [PDF]

, 2018
Ukratko, u ovom radu upoznali smo čitatelja s osnovama \(\lambda\)-računa --- jednog od modela za proučavanje izračunavanja koji je ujedno poslužio i kao temelj teorije funkcijskih programskih jezika.
Lovnički, Sandro
core   +1 more source

Functional Programming Using the New C++ Standard

Journal of Economic Development, Environment and People, 2015
Today software technology evolves very quickly, to an old paradigm, called functional programming. This paradigm uses lambda functions ready to be used where declared instead of function pointers.
Radu Bucea-Manea-Tonis, Rocsana Tonis (Bucea-Manea)   +1 more
doaj  

C, Lambda Calculus and Compiler Verification - a study in Haskell of purely-functional techniques for a formal specification of imperative programming languages and an epistemically-sound verification of their compilers

, 2011
Formal verification of a compiler is a long-standing problem in computer science and, although recent years have seen substantial achievements in the area, most of the proposed solutions do not scale very well with the complexity of modern software development environments.
openaire   +2 more sources

On conservativity of concurrent Haskell [PDF]

, 2011
The calculus CHF models Concurrent Haskell extended by concurrent, implicit futures. It is a process calculus with concurrent threads, monadic concurrent evaluation, and includes a pure functional lambda-calculus which comprises data constructors, case ...
Sabel, David (Dr.), Schmidt-Schauß, Manfred (Dr.)   +1 more
core   +1 more source

Modular, Fully-abstract Compilation by Approximate Back-translation

, 2017
A compiler is fully-abstract if the compilation from source language programs to target language programs reflects and preserves behavioural equivalence.
Devriese, Dominique, Keuchel, Steven, Patrignani, Marco, Piessens, Frank   +3 more
core   +1 more source

Linear-algebraic lambda-calculus

, 2005
With a view towards models of quantum computation and/or the interpretation of linear logic, we define a functional language where all functions are linear operators by construction.
Arrighi, Pablo, Dowek, Gilles
core   +1 more source

On generic context lemmas for lambda calculi with sharing [PDF]

, 2007
This paper proves several generic variants of context lemmas and thus contributes to improving the tools to develop observational semantics that is based on a reduction semantics for a language.
Sabel, David, Schmidt-Schauß, Manfred
core   +2 more sources