Acceder

Bibliografías temáticas / Lambda calculi

Índice

Artículos de revistas

Literatura académica sobre el tema "Lambda calculi"

Autor: Grafiati

Publicado: 11 de marzo de 2023

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Lambda calculi".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Artículos de revistas sobre el tema "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.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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.

Texto completo

Resumen

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

Los estilos APA, Harvard, Vancouver, ISO, etc.

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.

Texto completo

Resumen

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 .

Los estilos APA, Harvard, Vancouver, ISO, etc.

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.

Texto completo

Resumen

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

Los estilos APA, Harvard, Vancouver, ISO, etc.

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.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Más fuentes

Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!