scientific article

zbMath0988.68043MaRDI QIDQ2767004

Jean-Yves Marion, Jean-Yves Moyen

Publication date: 22 July 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Descriptive complexity and finite models (68Q19)

Related Items

Higher-order interpretations and program complexity, A Characterization of NC k by First Order Functional Programs, Analysing the implicit complexity of programs., Automated Implicit Computational Complexity Analysis (System Description), Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH, Quasi-interpretations. A way to control resources, Implicit complexity over an arbitrary structure: Quantifier alternations, Bounded Linear Logic, Revisited, Realizability models for a linear dependent PCF