Fundamenta Informaticae · 1998 · 118 citations · 21 references
ComputingComputer ScienceFormal MethodsLogicProgramming LanguagesFirst-order LogicFormal Language FoundationsRecursion TheoryRegular LanguagesType CheckingType SystemsAxiomatizationDatatypes TheoryKind SystemsRecursive TypesSubtypingType Theory
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by coinductive characterizations of type containment and type equality via
21
Fully abstract models of typed λ-calculi
Robin Milner · Theoretical Computer Science · 1977 · 477 citations · Full text
Semantics of programming languages: structures and techniques
Choice Reviews Online · 1993 · 422 citations
Roberto M. Amadio, Luca Cardelli · ACM Transactions on Programming Languages and Systems · 1993 · 353 citations · Full text