Вы здесь

Главная

ламбда-исчисление

Связанные издания:

Multi-Level Lambda-Calculi: An Algebraic Description
New Frontiers in Artificial Intelligence: Revised Selected Papers/JSAI-isAI 2016 Workshops, LENLS, HAT-MASH, AI-Biz, JURISIN and SKL, Kanagawa, Japan, November 2016
Normalization for Typed Lambda Calculi with Explicit Substitution
Notes on Sconing and Relators
Occurrences in debugger specifications
On Lazy Natural Numbers with Applications to Computability Theory and Functional Programming
On the Adequacy of Per Models
On the Definition of Lambda-Calculus Models
On the Relation between the -Calculus and the Syntactic Theory of Sequential Control
On the Subject Reduction Property for Algebraic Type Systems
On the Type Structure of Standard ML
Optimality and inefficiency: whot isn t a cost model of the lambda calculus
Parametric Polymorphism for Typed Prolog and Prolog
Partial Evaluation for the Lambda Calculus
Partial Evaluation of Call-by-value Lambda-calculus with Side-effects
Paths, Computations and Labels in the -calculus
Practical Aspects of Declarative Languages: Proc./24th International Symposium, PADL 2022, Philadelphia,PA,USA, January 2022
Prescriptive Frameworks for Multi-Level Lambda-Calculi
Processes, Terms, and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday
Programming Languages and Systems: Proc./30th European Symposium on Programming, ESOP 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 2021
Programming with Streams in Coq - A Case Study: The Sieve of Eratosthenes
Proof-Directed De-compilation of Low-Level Code
Pure Type Systems with Definitions
Quantitative Domains and Infinitary Algebras
Reasoning about Layered, Wildcard and Product Patterns
Reasoning with Higher Order Partial Functions
Recursive Types for Fun
Reflective Lambda-calculus
Rewrite Systems with Abstraction and -rule: Types, Approximants and Normalization
Rewriting Techniques and Applications: Proc./14th Intern. Conf., RTA 2003, Valencia, Spain, June 2003
Rewriting Techniques and Applications: Proc./19th International Conference, RTA 2008. Hagenberg, Austria, July 2008
Self-Applicable Online Partial Evaluation of the Pure Lambda Calculus
Semantics of the Typed lambda-calculus with Substitution in a Cartesian Closed Category
Some lambda calculi with categorical sums and products
Some Results on the Full Abstraction Problem for Restricted Lambda Calculi
Soundness of the Logical Framework for Its Typed Operational Semantics
SPCF: Its Model, Calculus, and Computational Power
Stackability in the Simply-Typed Call-By-Value Lambda Calculus
Staging Transformations for Abstract Machines
Strictness and Totality Analysis
Strong Normalization in a Non-Deterministic Typed Lambda-Calculus
Strong Normalization of Second Order Symmetric Lambda-mu Calculus
Strong Normalization of Substitutions
Subtyping Recursive Types
Subtyping with Singleton Types
Syntactic Definitions of Undefined: On Defining the Underfined
System F and Abstract Interpretation
Term Rewriting and Applications: Proc./16th International Conference, RTA 2005. Nara, Japan, April 2005
Term Rewriting and Applications: Proc./17th International Conference, RTA 2006. Seattle, WA, USA, August 2006
The Beauty of Functional Code: Essays Dedicated to Rinus Plasmeijer on the Occasion of His 61st Birthday