


default search action
TYPES 1994: Båstad, Sweden
- Peter Dybjer, Bengt Nordström, Jan M. Smith:

Types for Proofs and Programs, International Workshop TYPES'94, Båstad, Sweden, June 6-10, 1994, Selected Papers. Lecture Notes in Computer Science 996, Springer 1995, ISBN 3-540-60579-7 - René M. C. Ahn:

Communication Contexts: a Pragmatic Approach to Information Exchange. 1-13 - Herman Geuvers:

A short and flexible proof of Strong Normalization for the Calculus of Constructions. 14-38 - Eduardo Giménez:

Codifying Guarded Definitions with Recursive Schemes. 39-59 - Healfdene Goguen:

The Metatheory of UTT. 60-82 - Pascal Manoury:

A User's Friendly Syntax to Define Recursive Functions as Typed lambda-Terms. 83-100 - Tobias Nipkow, Konrad Slind:

I/Q Automata in Isabelle/HOL. 101-119 - Lawrence C. Paulson

:
A Concrete Final Coalgebra Theorem for ZF Set Theory. 120-139 - Robert Pollack:

On Extensibility of Proof Checkers. 140-161 - Aarne Ranta:

Syntactic Categories in the Language of Mathematics. 162-182 - Amokrane Saïbi:

Formalization of a lamda-Calculus with Explicit Substitutions in Coq. 183-202

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














