Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[كتاب][B] Advanced topics in types and programming languages
BC Pierce - 2024 - books.google.com
A thorough and accessible introduction to a range of key ideas in type systems for
programming language. The study of type systems for programming languages now touches …
programming language. The study of type systems for programming languages now touches …
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and
prove correct a strong reducer and ß-equivalence checker for the λ-calculus with products …
prove correct a strong reducer and ß-equivalence checker for the λ-calculus with products …
Coinductive big-step operational semantics
Using a call-by-value functional language as an example, this article illustrates the use of
coinductive definitions and proofs in big-step operational semantics, enabling it to describe …
coinductive definitions and proofs in big-step operational semantics, enabling it to describe …
A functional correspondence between evaluators and abstract machines
We bridge the gap between functional evaluators and abstract machines for the λ-calculus,
using closure conversion, transformation into continuation-passing style, and …
using closure conversion, transformation into continuation-passing style, and …
Biorthogonality, step-indexing and compiler correctness
We define logical relations between the denotational semantics of a simply typed functional
language with recursion and the operational behaviour of low-level programs in a variant …
language with recursion and the operational behaviour of low-level programs in a variant …
Distilling abstract machines
It is well-known that many environment-based abstract machines can be seen as strategies
in lambda calculi with explicit substitutions (ES). Recently, graphical syntaxes and linear …
in lambda calculi with explicit substitutions (ES). Recently, graphical syntaxes and linear …
[PDF][PDF] Refocusing in reduction semantics
The evaluation function of a reduction semantics (ie, a small-step operational semantics with
an explicit representation of the reduction context) is canonically defined as the transitive …
an explicit representation of the reduction context) is canonically defined as the transitive …
[PDF][PDF] Typed operational reasoning
The aim of this chapter is to explain, by example, some methods for reasoning about
equivalence of programs based directly upon a type system and an operational semantics …
equivalence of programs based directly upon a type system and an operational semantics …
Environments and the complexity of abstract machines
Abstract machines for functional languages rely on the notion of environment, a data
structure storing the previously encountered and delayed beta-redexes. This paper provides …
structure storing the previously encountered and delayed beta-redexes. This paper provides …
On the relative usefulness of fireballs
In CSL-LICS 2014, Accattoli and Dal Lago [1] showed that there is an implementation of the
ordinary (ie strong, pure, call-by-name) λ-calculus into models like RAM machines which is …
ordinary (ie strong, pure, call-by-name) λ-calculus into models like RAM machines which is …