FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

This page contains an index consisting of author-provided keywords.

A
adequate numeral system
C
call-by-value	Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus
cut elimination	Intersection Subtyping with Constructors
D
discrete polymorphism	Gradual Intersection Types
E
execution time	Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus
G
gradual typing	Gradual Intersection Types
I
intersection types	Natural Deduction and Normalization Proofs for the Intersection Type Discipline Intersection Subtyping with Constructors Gradual Intersection Types
L
lambda calculus	Strong normalization of simple types through uniform intersection types. Gradual Intersection Types
lambda-calculus	Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus
linear logic	Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus
N
Natural deduction	Natural Deduction and Normalization Proofs for the Intersection Type Discipline
non-idempotent intersection types	Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus
Normalization	Natural Deduction and Normalization Proofs for the Intersection Type Discipline
P
product types	Intersection Subtyping with Constructors
R
relational semantics	Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus
S
shuffling calculus	Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus
simple types	Strong normalization of simple types through uniform intersection types.
strongly normalizable terms
subject reduction	Intersection Subtyping with Constructors
Subtyping	Intersection Subtyping with Constructors
U
uniform intersection types	Strong normalization of simple types through uniform intersection types.

Disclaimer | Powered by EasyChair Smart Program