Now showing items 56-59 of 59

    • Teaching Math More Effectively, Through the Design of Calculational Proofs 

      Gries, David; Schneider, Fred B. (Cornell University, 1994-03)
      Lower-level college math courses usually avoid using formalism, in both definitions and proofs. Later, when students have mastered definitions and proofs written largely in English, they may be shown how informal reasoning ...
    • Trace-Based Network Proof Systems: Expressiveness and Completeness 

      Widom, Jennifer; Gries, David; Schneider, Fred B. (Cornell University, 1989-02)
      We consider incomplete trace-based network proof systems for safety properties, identifying extensions that are necessary and sufficient to achieve relative completeness. We then consider the expressiveness required of ...
    • Type Definitions in Polya 

      Volpano, Dennis M.; Gries, David (Cornell University, 1990-01)
      The programming language Polya maintains a clear separation between a type and its implementation through a new construct called the transform. Polya allows user to define their own data types and transforms to implement ...
    • What Programmers Don't and Should Know 

      Gries, David (Cornell University, 1987-09)