scientific article
From MaRDI portal
Publication:3804171
zbMath0656.68021MaRDI QIDQ3804171
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40)
Related Items (2)
On the expressive power of finitely typed and universally polymorphic recursive procedures ⋮ Characterizing complexity classes by general recursive definitions in higher types
This page was built for publication:
