scientific article; zbMATH DE number 2084367

zbMath1073.68561MaRDI QIDQ4475109

Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen

Publication date: 6 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2244/22440482.htm

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Higher-order interpretations and program complexity, Automatic synthesis of logical models for order-sorted first-order theories, A Characterization of NC k by First Order Functional Programs, Analyzing Innermost Runtime Complexity Through Tuple Interpretations, Unnamed Item, Unnamed Item, Quasi-interpretations. A way to control resources, Resource control for synchronous cooperative threads, A lexicographic path order with slow growing derivation bounds, Reactive Concurrent Programming Revisited

Uses Software

• Nuprl