A Simplified Application of Howard’s Vector Notation System to Termination Proofs for Typed Lambda-Calculus Systems

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	WRLA (13. : 2020 : Online) Rewriting logic and its applications
1. Verfasser:	Okada, Mitsuhiro (VerfasserIn)
Weitere Verfasser:	Takahashi, Yuta (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2020
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
Automated Construction of Security Integrity Wrappers for Industry 4.0 Applications	2020	Nigam, Vivek
Verification of the IBOS Browser Security Properties in Reachability Logic	2020	Skeirik, Stephen
Analysis of the Runtime Resource Provisioning of BPMN Processes Using Maude	2020	Durán, Francisco
Variant Satisfiability of Parameterized Strings	2020	Meseguer, José
A Simplified Application of Howard’s Vector Notation System to Termination Proofs for Typed Lambda-Calculus Systems	2020	Okada, Mitsuhiro
Combining Parallel Graph Rewriting and Quotient Graphs	2020	Tour, Thierry Boy de la
A Rule-Based System for Computation and Deduction in Mathematica	2020	Marin, Mircea
Inductive Reasoning with Equality Predicates, Contextual Rewriting and Variant-Based Simplification	2020	Meseguer, Jose
Connecting Constrained Constructor Patterns and Matching Logic	2020	Chen, Xiaohong
Variants in the Infinitary Unification Wonderland	2020	Meseguer, José
Strategies, Model Checking and Branching-Time Properties in Maude......	2020	Rubio, Rubén