A Calculus Of Higher-order Parameterization For Algebraic Specifications

Logic Journal of the IGPL 3 (4):615-641 (1995)
  Copy   BIBTEX

Abstract

A specification language is presented which provides three specification-building operators: amalgamated union, renaming and restriction. The language is enhanced with parameterization over higher-order variables based on the simply typed lambda calculus. Context dependencies that ensure the well-definedness of a parameterized specification, are defined over a calculus of requirements and can be syntactically derived. A contextual proof system for parameterized specifications is also presented, that is correct and relatively complete

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,551

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Unification of Simply Typed Lambda-terms as Logic Programming.Dale Miller - 1991 - LFCS, Department of Computer Science, University of Edinburgh.
A First-Order Sequent Calculus for Logical Inferentialists and Expressivists.Shuhei Shimamura - 2019 - In Igor Sedlár & Martin Blicha (eds.), The Logica Yearbook 2018. College Publications. pp. 211-228.
Continuation-passing style models complete for intuitionistic logic.Danko Ilik - 2013 - Annals of Pure and Applied Logic 164 (6):651-662.
On the λY calculus.Rick Statman - 2004 - Annals of Pure and Applied Logic 130 (1-3):325-337.

Analytics

Added to PP
2015-02-04

Downloads
12 (#1,373,211)

6 months
7 (#718,806)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references