Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Higher-Order Pattern Unification for Dependently Typed Records
 

Summary: Higher-Order Pattern Unification for
Dependently Typed Records
Andreas Abel
(joint work with Brigitte Pientka)
Department of Computer Science
Ludwig-Maximilians-University Munich
The 13th Agda Implementor's Meeting
Chalmers University, Gothenburg, Sweden
6 April 2011
Andreas Abel (joint work with Brigitte Pientka) (LMU) AIM XIII 2011 1 / 11
Introduction
Miller pattern unification
Hidden arguments and placeholders create unification problems.
data Sigma (A : Set)(B : A Set) : Set where
_,_ : (a : A) B a Sigma A B
pair : (X : Set)(Y : X Set)(x : X)(y : Y x) Sigma X Y
pair X Y x y = x , y
Look behind the curtain with {-# OPTIONS -v tc.meta:20 #-}
Making hidden arguments explicit:
_,_ : {A : Set}{B : A Set}(a : A) B a Sigma A B

  

Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universit√§t M√ľnchen

 

Collections: Computer Technologies and Information Sciences