Generalization from partial parametrization in higher-order type theory

DOI10.1016/0304-3975(89)90074-1zbMath0676.68008OpenAlexW2025821017MaRDI QIDQ1122980

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

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)

Related Items (1)

Analogical program derivation based on type theory

Uses Software

• ML

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Pebble, a kernel language for modules and abstract data types
• A theory of type polymorphism in programming
• Proofs as programs
• The Type Theory of PL/CV3
• Program abstraction and instantiation

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