CSL 1999 | Sciweavers

31

CSL
1999
Springer

139views Automated Reasoning» more CSL 1999»

14 years 4 months ago

This paper gives the ﬁrst proof that the subtyping relation of a higherorder lambda calculus, Fω ≤, is anti-symmetric, establishing in the process that the subtyping relation...

Adriana B. Compagnoni, Healfdene Goguen

claim paper

Read More »

39

click to vote

CSL
1999
Springer

90views Automated Reasoning» more CSL 1999»

A Road-Map on Complexity for Hybrid Logics

14 years 4 months ago

Download www.loria.fr

Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...

Carlos Areces, Patrick Blackburn, Maarten Marx

claim paper

Read More »

29

click to vote

CSL
1999
Springer

83views Automated Reasoning» more CSL 1999»

Monadic Presentations of Lambda Terms Using Generalized Inductive Types

14 years 4 months ago