Automating Recursive Type Definitions in Higher Order Logic

Մատենագիտական մանրամասներ
Հիմնական հեղինակ: Melham, T
Ձևաչափ: Report
Հրապարակվել է: Computer Laboratory‚ University of Cambridge 1988
_version_ 1826297644515852288
author Melham, T
author_facet Melham, T
author_sort Melham, T
collection OXFORD
description
first_indexed 2024-03-07T04:34:48Z
format Report
id oxford-uuid:cf8fcda3-bc9d-473b-b47f-4e0a7253fac3
institution University of Oxford
last_indexed 2024-03-07T04:34:48Z
publishDate 1988
publisher Computer Laboratory‚ University of Cambridge
record_format dspace
spelling oxford-uuid:cf8fcda3-bc9d-473b-b47f-4e0a7253fac32022-03-27T07:43:26ZAutomating Recursive Type Definitions in Higher Order LogicReporthttp://purl.org/coar/resource_type/c_93fcuuid:cf8fcda3-bc9d-473b-b47f-4e0a7253fac3Department of Computer ScienceComputer Laboratory‚ University of Cambridge1988Melham, T
spellingShingle Melham, T
Automating Recursive Type Definitions in Higher Order Logic
title Automating Recursive Type Definitions in Higher Order Logic
title_full Automating Recursive Type Definitions in Higher Order Logic
title_fullStr Automating Recursive Type Definitions in Higher Order Logic
title_full_unstemmed Automating Recursive Type Definitions in Higher Order Logic
title_short Automating Recursive Type Definitions in Higher Order Logic
title_sort automating recursive type definitions in higher order logic
work_keys_str_mv AT melhamt automatingrecursivetypedefinitionsinhigherorderlogic