Programming Languages and Systems

DOI10.1007/11575467zbMATH Open1159.68383MaRDI QIDQ5493392FDOQ5493392

Authors: Damien Sereni, Neil D. Jones 

Publication date: 20 October 2006

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

Recommendations

• Rewriting Techniques and Applications
• The size-change principle for program termination
• Automatic Termination Verification for Higher-Order Functional Programs
• The size-change termination principle for constructor based languages
• Call-by-value Termination in the Untyped lambda-calculus

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Cited In (16)

• Title not available (Why is that?)
• Automatic termination analysis for functional and imperative programs (Thesis, TU Darmstadt)
• Rewriting Techniques and Applications
• The size-change termination principle for constructor based languages
• Büchi Complementation and Size-Change Termination
• A SAT-Based Approach to Size Change Termination with Global Ranking Functions
• Termination analysis for offline partial evaluation of a higher order functional language
• Termination analysis and call graph construction for higher-order functional programs
• Title not available (Why is that?)
• Automatic Termination Verification for Higher-Order Functional Programs
• Programming Languages and Systems
• Typing termination in a higher-order concurrent imperative language
• Analysing the complexity of functional programs: higher-order meets first-order
• Type-based termination of generic programs
• Termination analysis for functional programs
• Call-by-value Termination in the Untyped lambda-calculus

Uses Software

• OCaml

This page was built for publication: Programming Languages and Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5493392)