• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Wp-gen
      • Dimacs-reader
      • Pfcs
        • Proof-support
        • Abstract-syntax
          • Syntax-abstraction
          • Expression
          • Definition
          • Constraint
          • Definition-option
          • Abstract-syntax-operations
          • System
          • Convenience-constructors
          • System-result
          • Expression-result
          • Expression-list-result
          • Definition-result
          • Definition-list-result
          • Constraint-result
          • Constraint-list-result
          • Expression-list
          • Definition-list
          • Constraint-list
        • R1cs-subset
        • Semantics
        • Abstract-syntax-operations
        • Indexed-names
        • Well-formedness
        • Concrete-syntax
        • R1cs-bridge
        • Parser-interface
      • Legacy-defrstobj
      • Proof-checker-array
      • Soft
      • C
      • Farray
      • Rp-rewriter
      • Instant-runoff-voting
      • Imp-language
      • Sidekick
      • Leftist-trees
      • Java
      • Taspi
      • Bitcoin
      • Riscv
      • Des
      • Ethereum
      • X86isa
      • Sha-2
      • Yul
      • Zcash
      • Proof-checker-itp13
      • Regex
      • ACL2-programming-language
      • Json
      • Jfkr
      • Equational
      • Cryptography
      • Poseidon
      • Where-do-i-place-my-book
      • Axe
      • Bigmems
      • Builtins
      • Execloader
      • Aleo
      • Solidity
      • Paco
      • Concurrent-programs
      • Bls12-377-curves
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
    • Math
    • Testing-utilities
  • Pfcs

Abstract-syntax

Abstract syntax of PFCSes.

Expressions are built out of constants, variables, and field operations. A basic constraint is an equality between expressions. Constraints may be (conjunctively) grouped into named relations (see definition), which may be conjoined with equality constraints. A system of constraints is a collection of named relations, which are hierarchically organized, and of constraints that may reference the relations.

Subtopics

Syntax-abstraction
Mapping from concrete to abstract syntax, for PFCS.
Expression
Fixtype of expressions.
Definition
Fixtype of definitions of relations.
Constraint
Fixtype of constraints.
Definition-option
Fixtype of optional definitions of relations.
Abstract-syntax-operations
Operations on the abstract syntax of PFCSes.
System
Fixtype of systems of constraints.
Convenience-constructors
Utilities to convniently construct PFCS abstract syntax.
System-result
Fixtype of errors and PFCS systems.
Expression-result
Fixtype of errors and PFCS expressions.
Expression-list-result
Fixtype of errors and lists of PFCS expressions.
Definition-result
Fixtype of errors and PFCS definitions.
Definition-list-result
Fixtype of errors and lists of PFCS definitions.
Constraint-result
Fixtype of errors and PFCS constraints.
Constraint-list-result
Fixtype of errors and lists of PFCS constraints.
Expression-list
Fixtype of lists of expressions.
Definition-list
Fixtype of lists of definitions of relations.
Constraint-list
Fixtype of lists of constraints.