Bracket Abstraction Preserves Typability - A formal proof of Diller-algorithm-C in PVS

Find Full text
Thumbnail
Fulltext:
36022.pdf
Size:
206.6Kb
Format:
PDF
Description:
Author’s version preprint
Download
Publication year
2006
Author(s)
Smetsers, Sjaak
Weelden, Arjen van
Publisher
Seattle, Washington : s.n.
In
Levy, J. (ed.), FLoC 2006: Workshop of the Federated Logic Conference: Proceedings 20th International Workshop on Unification (UNIF'06), Seattle, W, USA, August 11, 2006, pp. 29-43
Annotation
FloC 2006; UNIF'06
Publication type
Article in monograph or in proceedings
If a DOI or any other persistent identifier is unavailable, please use the following repository identifier to link to this item: https://hdl.handle.net/2066/36022   https://hdl.handle.net/2066/36022
Display more details

Upload full text

Use your RU credentials (u/z-number and password) to log in with SURFconext to upload a file for processing by the repository team.