Generalization from partial parametrization in higher-order type theory

DOI10.1016/0304-3975(89)90074-1zbMATH Open0676.68008OpenAlexW2025821017MaRDI QIDQ1122980FDOQ1122980

Authors: Masami Hagiya 

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90074-1

Recommendations

• Higher order generalization and its application in program verification
• scientific article; zbMATH DE number 1301764
• scientific article; zbMATH DE number 1696597
• Order-sorted generalization
• Programming by example and proving by example using higher-order unification

zbMATH Keywords

formulae-as-typesgeneralizing a programlargest sum segment problemlongest up segment problemsoftware reusabilitytypical higher-order type theory

Mathematics Subject Classification ID

Theory of software (68N99)

Cites Work

• A theory of type polymorphism in programming
• Title not available (Why is that?)
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Proofs as programs
• Title not available (Why is that?)
• The Type Theory of PL/CV3
• Pebble, a kernel language for modules and abstract data types
• Program abstraction and instantiation

Cited In (8)

• Programming by example and proving by example using higher-order unification
• Order-sorted generalization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Analogical program derivation based on type theory
• Title not available (Why is that?)
• Higher order generalization and its application in program verification
• Generalizing Def and Pos to Type Analysis

Uses Software

• ML

This page was built for publication: Generalization from partial parametrization in higher-order type theory

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