scientific article; zbMATH DE number 7756108
From MaRDI portal
Publication:6079229
DOI10.4230/lipics.types.2019.3arXiv1912.01914MaRDI QIDQ6079229
Daniel Lima Ventura, Sandra Alves, Delia Kesner
Publication date: 27 October 2023
Full work available at URL: https://arxiv.org/abs/1912.01914
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A semantic account of strong normalization in linear logic
- A relational semantics for parallelism and non-determinism in a functional setting
- Linear logic
- Type-based cost analysis for lazy functional languages
- Linear dependent types in a call-by-value scenario
- The rewriting calculus - part I
- A Resource Aware Computational Interpretation for Herbelin’s Syntax
- Reasoning About Call-by-need by Means of Types
- Non-idempotent intersection types and strong normalisation
- Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus
- Quantitative Types for the Linear Substitution Calculus
- Using Intersection Types for Cost-Analysis of Higher-Order Polymorphic Functional Programs
- First-class patterns
- A linearization of the Lambda-calculus and consequences
- Size-based termination of higher-order rewriting
- Execution time of λ-terms via denotational semantics and intersection types
- Non-idempotent intersection types for the Lambda-Calculus
- A semantics for lambda calculi with resources
- Linear Dependent Types and Relative Completeness
- The Negligible and Yet Subtle Cost of Pattern Matching
- Pattern-based calculi with finitary matching
- Tight typings and split bounds, fully developed
- Consuming and Persistent Types for Classical Logic
- Static determination of quantitative resource usage for higher-order programs
- Essential and relational models
- Observability for Pair Pattern Calculi
- Functional and Logic Programming
- Towards automatic resource bound analysis for OCaml
- On phase semantics and denotational semantics: The exponentials
- Types of fireballs
This page was built for publication:
