Quty(ID:1115/qut002)

Functional plus logic.

Structures:
Related languages
Quty => Tiny Quty   Subset
References:
  • Sato, M. et al, "Quty: A Functional Language Based on Unification", in Conf Fifth Gen Computer Systems, ICOT 1984, pp.157-165. view details
  • Sato, M., "Typed Logical Calculus", Technical Report 85-13, Department of Information Science, Faculty of Science, University of Tokyo, 1985 view details
  • Sato, M., "Quty: A Concurrent Language Based on Logic and Function", Proceedings of the Fourth International Conference on Logic Programming, The MIT Press, 1987 view details
  • Takayama, Yukihide "Extended projection?new method to extract efficient programs from constructive proofs" Proceedings of the fourth international conference on Functional Programming Languages and Computer Architecture Imperial College, London, United Kingdom pp299 - 312 view details DOI Abstract: This paper gives a method to extract redundancy free
    programs from constructive proofs, using the realizability
    interpretation. The proof trees are analyzed in
    the style of program analysis, and they are mechanically
    translated into trees with additional information,
    called marked proof trees. The program extractor takes
    marked proof trees as input, and generates programs in
    a type-free lambda calculus with sequences.