A syntactic view of computational adequacy
type: Item
instance of: scholarly article
title: A syntactic view of computational adequacy
zbMATH Open document ID: 1504.68038
DOI: 10.1007/978-3-319-89366-2_4
author: Marco Devesas Campos
author: Paul Blain Levy
publication date: 2018-07-17T00:00:00Z
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 6904530
MaRDI profile type: Publication
full work available at URL: 978-3-319-89366-2 4
OpenAlex ID: W2796485637
Recommended article: On Syntactic versus Computational Views of Approximability
Recommended article: Formalizing adequacy: a case study for higher-order abstract syntax
Recommended article: Syntactic Completeness of Proper Display Calculi
Recommended article: Q3974858
Recommended article: Computational complexity of syntactic agreement and lexical ambiguity
Recommended article: Q3769985
Recommended article: Aristotelian Syntax from a Computational–Combinatorial Point of View
Recommended article: Computational adequacy of the FIX-logic
Recommended article: Semantics-to-Syntax Analyses of Algorithms
Recommended article: On the semantic equivalence of language syntax formalisms
description: scientific article; zbMATH DE number 6904530