scientific article; zbMATH DE number 7029315
From MaRDI portal
Publication:4625705
zbMath1486.68031arXiv1801.03886MaRDI QIDQ4625705
Kazuyuki Asada, Ryoma Sin'ya, Takeshi Tsukada, Naoki Kobayashi
Publication date: 25 February 2019
Full work available at URL: https://arxiv.org/abs/1801.03886
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A concrete approach to classical analysis
- Complexity analysis of term-rewriting systems
- Exact bounds for lengths of reductions in typed λ-calculus
- A Natural Counting of Lambda Terms
- Saturation-Based Model Checking of Higher-Order Recursion Schemes.
- Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction Sequence
- On the likelihood of normalization in combinatory logic
- Patterns and pattern-matching in trees: An analysis
- Asymptotically almost all \lambda-terms are strongly normalizing
- Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus
- Types and higher-order recursion schemes for verification of higher-order programs
- Model Checking Higher-Order Programs
- Counting and generating lambda terms
- A type-directed abstraction refinement approach to higher-order model checking
- Verifying higher-order functional programs with pattern-matching algebraic data types
- Computational Complexity
This page was built for publication:
