Inferring Static Non-monotone Size-aware Types Through Testing

DOI10.1016/j.entcs.2008.06.033zbMath1283.68129OpenAlexW2135502076MaRDI QIDQ5403477

Olha Shkaravska, Marko van Eekelen, Ron van Kesteren

Publication date: 26 March 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.06.033

zbMATH Keywords

testingtype checkingmemory complexity analysis

Mathematics Subject Classification ID

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

Related Items

Polynomial solutions of algebraic difference equations and homogeneous symmetric polynomials

Uses Software

• ML

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On list primitive recursion and the complexity of computing inf
• Multivariate Birkhoff interpolation
• A theory of type polymorphism in programming
• Polynomial Size Analysis of First-Order Functions
• Implementation of Functional Languages
• OCaml + XDuce
• Calculating sized types