MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Semantics for Higher Order Abstract Syntax

Chad Brown
Fachrichtung Informatik - Saarbrücken
Talk
AG 1, AG 3, AG 5, RG2, AG 2, AG 4, RG1, SWS  
AG Audience
English

Date, Time and Location

Thursday, 13 December 2007
15:30
30 Minutes
E1 3
528
Saarbrücken

Abstract

Higher order abstract syntax is a method for formally representing syntax with binders by using binders in the meta language to represent binders in the object language. A problem with higher order abstract syntax is that it is inconsistent with standard set theoretic semantics. In my talk I will give an example demonstrating the problem and describe how to construct a model of higher order abstract syntax using M-sets over a monoid M of explicit substitutions.

Contact

Chad Brown
3025340
--email hidden
passcode not visible
logged in users only

Tags, Category, Keywords and additional notes

Theorem Proving; Higher Order Logic

Chad Brown, 12/05/2007 16:12 -- Created document.