The Programming System PRIZ

@inproceedings{Mints1988ThePS,
  title={The Programming System PRIZ},
  author={Grigori Mints and Enn Tyugu},
  booktitle={Journal of symbolic computation},
  year={1988}
}
  • G. MintsE. Tyugu
  • Published in
    Journal of symbolic…
     1 June 1988
  • Computer Science
View via Publisher
doi.org
31 Citations
Background Citations
3
Methods Citations
5

Figures from this paper

31 Citations

Propositional Logic Programming and Priz System

Extensions of Structural Synthesis of Programs

It is indicated that the proof search strategy used in SSP systems is applicable to a variety of natural-deduction proof systems, and that the object-oriented user front-end speciication language of the NUT programming environment can, in fact, be given a useful logical semantics in terms of intuitionistic rst-order logic.

Extensions of Structural Synthesis of ProgramsTarmo

It is indicated that the proof search strategy used in SSP systems is applicable to a variety of natural-deduction proof systems, and that the object-oriented user front-end speciication language of the NUT programming environment can, in fact, be given a useful logical semantics in terms of intuitionistic rst-order logic.

Three new-generation software environments

Structural program synthesis—an automatic program synthesis technique developed in the Estonian Academy of Sciences and initially implemented on old mainframe computers can be considered as a particular method of logic programming—propositional logic programming.

Using classes as specifications for automatic construction of programs in the NUT system

  • E. Tyugu
  • Computer Science
    Automated Software Engineering
  • 2004
It is shown, how the object-oriented programming paradigm has been combined with automatic program construction in the NUT system: type information extracted from a class specification is being used…

Constraints in NUT

NUT is a programming system for knowledge-based programming with facilities for automatic program synthesis. The system allows to specify computational problems in OO style. Concepts and objects can…

Computational and Attribute Models of Formal Languages

  • J. Penjam
  • Computer Science
    Theor. Comput. Sci.
  • 1990

Knowledge-based programming environments

  • E. Tyugu
  • Computer Science
    Knowl. Based Syst.
  • 1991

Program specification and synthesis using systems of equations over data structures

A systematic discussion of previously known and new methods for the solution of analysis and synthesis problems in the form of functional equations and synthesis of programs from such equational specifications is presented.

A Tableau-Like Proof Procedure for Normal Modal Logics

10 References

Justifications of the Structural Synthesis of Programs

Compilation of Nonprocedural Specifications into Computer Programs

The paper describes the compilation of a program specification, written in the very high level nonprocedural MODEL language, into an object, PL/1 or Cobol, procedural language program. Nonprocedural…

The formulae-as-types notion of construction

The ultimate goal was to develop a notion of construction suitable for the interpretation of intuitionistic mathematics, so the use of the word construction is not very appropriate, but the terminology has been kept in order to preserve the original title.

Knowledge-based programming

Introduction to Metamathematics

Synthesis of semantic processors from attribute grammars

  • System Programming Comput. Software NI,
  • 1983

Structural synthesis with independent subtasks and modal logic $4

  • Eesti NSV TA Toimetised (Proc. of the Estonian Academy of Sci). Mathem.,
  • 1984

Theorem proving with the aid of program

  • synthesizer. Cybernetics
  • 1982

Computational models with separable problems. Cybernetics (Teehnicheskaya Kibernetika) NS

  • 1985

Instrumental Programming System ES EVM (PRIZ)

  • Moscow: Finansy i Statistika (in Russian)
  • 1981