Relevant bibliographies by topics / Lambda calculi

Contents

  1. Journal articles

Academic literature on the topic 'Lambda calculi'

Author: Grafiati
Published: 11 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Lambda calculi.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Lambda calculi"

1

Zamdzhiev, Vladimir. "Computational Adequacy for Substructural Lambda Calculi." Electronic Proceedings in Theoretical Computer Science 333 (February 8, 2021): 322–34. http://dx.doi.org/10.4204/eptcs.333.22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

KAMAREDDINE, FAIROUZ. "Typed $\lambda$-calculi with one binder." Journal of Functional Programming 15, no. 05 (2005): 771. http://dx.doi.org/10.1017/s095679680500554x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Boudol, G. "Lambda-Calculi for (Strict) Parallel Functions." Information and Computation 108, no. 1 (1994): 51–127. http://dx.doi.org/10.1006/inco.1994.1003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Staples, John. "Delaying unification algorithms for lambda calculi." Theoretical Computer Science 56, no. 3 (1988): 277–88. http://dx.doi.org/10.1016/0304-3975(88)90135-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

BOUDOL, GÉRARD, PIERRE-LOUIS CURIEN, and CAROLINA LAVATELLI. "A semantics for lambda calculi with resources." Mathematical Structures in Computer Science 9, no. 4 (1999): 437–82. http://dx.doi.org/10.1017/s0960129599002893.

Full text
Abstract:
We present the λ-calculus with resources λr, and two variants of it: a deterministic restriction λm and an extension λcr with a convergence testing operator. These calculi provide a control on the substitution process – deadlocks may arise if not enough resources are available to carry out all the substitutions needed to pursue a computation. The design of these calculi was motivated by Milner's encoding of the λ-calculus in the π-calculus. As Boudol and Laneve have shown elsewhere, the discriminating power of λm (given by the contextual observational equivalence) over λ-terms coincides with t
APA, Harvard, Vancouver, ISO, and other styles
6

Katayama, Susumu. "Computable Variants of AIXI which are More Powerful than AIXItl." Journal of Artificial General Intelligence 10, no. 1 (2019): 1–23. http://dx.doi.org/10.2478/jagi-2019-0001.

Full text
Abstract:
Abstract This paper presents Unlimited Computable AI, or UCAI, that is a family of computable variants of AIXI. UCAI is more powerful than AIXItl, which is a conventional family of computable variants of AIXI, in the following ways: 1) UCAI supports models of terminating computation, including typed lambda calculi, while AIXItl only supports Turing machine with timeout ˜t, which can be simulated by typed lambda calculi for any ˜t; 2) unlike UCAI, AIXItl limits the program length to some ˜l .
APA, Harvard, Vancouver, ISO, and other styles
7

ZORZI, MARGHERITA. "On quantum lambda calculi: a foundational perspective." Mathematical Structures in Computer Science 26, no. 7 (2014): 1107–95. http://dx.doi.org/10.1017/s0960129514000425.

Full text
Abstract:
In this paper, we propose an approach to quantum λ-calculi. The ‘quantum data-classical control’ paradigm is considered. Starting from a measurement-free untyped quantum λ-calculus calledQ, we will study standard properties such as confluence and subject reduction, and some good quantum properties. We will focus on the expressive power, analysing the relationship with other quantum computational models. Successively, we will add an explicit measurement operator toQ. On the resulting calculus, calledQ*, we will propose a complete study of reduction sequences regardless of their finiteness, prov
APA, Harvard, Vancouver, ISO, and other styles
8

Mulmuley, Ketan. "Fully abstract submodels of typed lambda calculi." Journal of Computer and System Sciences 33, no. 1 (1986): 2–46. http://dx.doi.org/10.1016/0022-0000(86)90041-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Nielson, Flemming, and Hanne Riis Nielson. "Prescriptive Frameworks for Multi-Level Lambda-Calculi." ACM SIGPLAN Notices 32, no. 12 (1997): 193–202. http://dx.doi.org/10.1145/258994.259018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Joy, M. "Lambda Calculi: A Guide For Computer Scientists." Computer Journal 38, no. 1 (1995): 78–79. http://dx.doi.org/10.1093/comjnl/38.1.78-a.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources
You might also be interested in the extended bibliographies on the topic 'Lambda calculi' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography