Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 20 for “"lambda-calculus"”.
-
Lambda-calculus models of programming languages.
Massachusetts Institute of Technology, Alfred P. Sloan School of Management. Thesis. 1969. Ph.D.
-
Lambda calculus models of typed programming languages
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1984.
-
A security kernel based on the lambda-calculus
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
-
Optimal interpreters for lambda-calculus based functional languages
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1990.
-
Learning to map sentences to logical form
… for learning to map sentences to logical form - lambda-calculus representations of their meanings. We first describe an approach to the context-independent learning problem, where sentences are analyzed in isolation. We describe a learning algorithm that takes as input a training set of sentences …
-
Cartesian closed bicategories: type theory and coherence
… correspondence between the simply-typed lambda calculus and cartesian closed categories to the bicategorical setting, then use the resulting type theory to prove a coherence result for cartesian closed bicategories. Cartesian closed bicategories---2-categories `up to isomorphism' equipped …
-
The kernel of ad hoc polymorphism
… new formalization of this old concept as a typed lambda calculus. Motivated by the aspiration of extending System F with ad hoc constraints, we introduce a new mechanism for implicit parameter passing. Putting these ideas together, we present a practical replacement for bounded type quantification …
-
Contributions to the theory of syntax with bindings and to process algebra
… a development of call-by-name and call-by-value lambda-calculus with constants, including Church-Rosser theorems, connection with de Bruijn representation, connection with other Isabelle formalizations, HOAS representation, and contituation-passing-style (CPS) transformation; - a proof in HOAS of …
-
A calculus for composable, computational cryptography
… UC framework. Our main contribution is a process calculus, dubbed the Interactive Lambda Calculus (ILC). ILC faithfully captures the computational model underlying UC—interactive Turing machines (ITMs)—by adapting ITMs to a subset of the π-calculus through an affine typing discipline. In other …
-
Region-based Program Specialization
… Our approach is based on the region calculus of Tofte and Talpin, a polymorphically typed lambda calculus with annotations that make memory allocation and deallocation explicit. The formal correctness proof of our novel specialization technique based on a region type system requires …
-
A modular programming language for engineering design
… generalizes other functional models like the lambda calculus and combinatory logic. This model leads naturally to a new type of programming language that combines the key strengths of imperative and functional languages for development and analysis of programs. These strengths have particular …
-
Reasoning Using Higher-Order Abstract Syntax in a Higher-Order Logic Proof Environment: Improvements to Hybrid and a Case Study
… of Hybrid (with these improvements) for a lambda-calculus-like subset of Isabelle/HOL syntax, at the level of set-theoretic semantics and without unfolding Hybrid's definition in terms of de Bruijn indices. In further work, we prove an induction principle that maintains some of the benefits …
-
Discovering Abstractions from Language via Neurosymbolic Program Synthesis
… algorithm that identifies useful abstractions in lambda calculus expressions. Lilo augments Stitch with AutoDoc, which generates human-readable names and docstrings for abstractions using an LLM. In addition to improving interpretability, we find that AutoDoc crucially assists Lilo’s synthesizer …
-
Verificación formal en ACL2 del algoritmo de Buchberger
… language, a subset of COMMON LISP, based in pure lambda-calculus. It was developed in the University of Texas at Austin (USA) and is based in an untyped quantifier-free first-order logic of total recursive functions with equality. This thesis presents a computational theory about Buchberger's …
-
On the making and meaning of chains
… trace position. The second main result is that lambda calculus is superior to both standard predicate logic and combinatorial logic as the mathematical model for the semantic mechanism mediating the dependency of trace (or bound pronoun) and binder. Chapter 4 argues this on the basis of the …
-
Formally justified and modular Bayesian inference for probabilistic programs
… The semantics is defined for an expressive typed lambda calculus with higher-order functions and inductive types, extended with probabilistic effects for sampling and conditioning, allowing continuous distributions and unbounded likelihoods. It makes crucial use of the recently developed formalism …
-
Parameterized monads in linguistics
This dissertation follows the formal semantics approach to linguistics. It applies recent developments in computing theories to study theoretical linguistics in the area of the interaction between semantics and pragmatics and analyzes several natural language phenomena by parsing them in these …