Publication:4475109
From MaRDI portal
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
68Q25: Analysis of algorithms and problem complexity
68N18: Functional programming and lambda calculus
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Unnamed Item, Unnamed Item, Reactive Concurrent Programming Revisited, Analyzing Innermost Runtime Complexity Through Tuple Interpretations, Higher-order interpretations and program complexity, Quasi-interpretations. A way to control resources, Automatic synthesis of logical models for order-sorted first-order theories, Resource control for synchronous cooperative threads, A Characterization of NC k by First Order Functional Programs, A lexicographic path order with slow growing derivation bounds
Uses Software