This report describes the Environment for Formal Systems, EFS, that allows a user to interactively define the syntax and inference rules of a formal system and to construct proofs in the defined system. The EFS supports two AUTOMATH-like formalisms for encoding logics: the Edinburgh Logical Framework and the Calculus of Constructions. Facilities are provided for the definition of notational abbreviations and the construction of goal-directed proofs. New goal-directed rules can be interactively defined and checked for validity. The EFS was implemented with the Cornell Synthesizer Generator
AbstractThe elementary formal systems (EFS for short) Smullyan invented to develop his recursive fun...
Proc. COLT\u2789, 312-327; Theoretical Computer Science 95, 97-113, 1992This paper presents a unifyi...
Computer science researchers in the programming languages and formal verification communities, among...
Proc. Logic Programming Conference 1989, 123-132In this paper, we give a theoretical foundation of E...
Abstract. We describe an environment that allows the users of the Theorema system to flexibly contro...
Abstract. We describe an environment that allows the users of the Theorema system to flexibly contro...
The elementary formal systems (EFS\u27s for short) work as a theoretical basis in the various fields...
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on ...
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on ...
A number of industrial software development standards mandate that safetycritical software component...
As software is increasingly used to control critical systems, program correctness becomes paramount....
Abstract. We propose a natural framework, called NF, which supports development of formal proofs on ...
Abstract. Nowadays, in many critical situations (such as on-board software), it is mandatory to cert...
The elementary formal system(EFS, for short) is a kind of logic programs over the domain of strings....
Copyright © 2005, Australian Computer Society, Inc.A number of industrial software development stand...
AbstractThe elementary formal systems (EFS for short) Smullyan invented to develop his recursive fun...
Proc. COLT\u2789, 312-327; Theoretical Computer Science 95, 97-113, 1992This paper presents a unifyi...
Computer science researchers in the programming languages and formal verification communities, among...
Proc. Logic Programming Conference 1989, 123-132In this paper, we give a theoretical foundation of E...
Abstract. We describe an environment that allows the users of the Theorema system to flexibly contro...
Abstract. We describe an environment that allows the users of the Theorema system to flexibly contro...
The elementary formal systems (EFS\u27s for short) work as a theoretical basis in the various fields...
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on ...
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on ...
A number of industrial software development standards mandate that safetycritical software component...
As software is increasingly used to control critical systems, program correctness becomes paramount....
Abstract. We propose a natural framework, called NF, which supports development of formal proofs on ...
Abstract. Nowadays, in many critical situations (such as on-board software), it is mandatory to cert...
The elementary formal system(EFS, for short) is a kind of logic programs over the domain of strings....
Copyright © 2005, Australian Computer Society, Inc.A number of industrial software development stand...
AbstractThe elementary formal systems (EFS for short) Smullyan invented to develop his recursive fun...
Proc. COLT\u2789, 312-327; Theoretical Computer Science 95, 97-113, 1992This paper presents a unifyi...
Computer science researchers in the programming languages and formal verification communities, among...