Refinement Types as Higher-Order Dependency Pairs

DOI10.4230/LIPIcs.RTA.2011.299zbMath1236.68147OpenAlexW2963540121MaRDI QIDQ5389088

Cody Roux

Publication date: 24 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_2f9e.html

zbMATH Keywords

higher-orderdependency pairsrefinement types

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Uses Software

• Automath

This page was built for publication: Refinement Types as Higher-Order Dependency Pairs