• Top
    • Documentation
    • Books
    • Recursion-and-induction
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
      • Kestrel-books
        • Crypto-hdwallet
        • Error-checking
        • Apt
        • Abnf
        • Fty-extensions
        • Isar
        • Kestrel-utilities
        • Prime-field-constraint-systems
          • Proof-support
          • R1cs-subset
          • Semantics
          • Abstract-syntax
          • Well-formedness
            • Definition-list-wfp
            • Definition-wfp
            • Constraint-wfp
            • Constraint-list-wfp
            • System-wfp
          • Abstract-syntax-operations
          • R1cs-bridge
          • Concrete-syntax
          • Prime-field-library-extensions
          • R1cs-library-extensions
        • Soft
        • Bv
        • Imp-language
        • Event-macros
        • Bitcoin
        • Ethereum
        • Yul
        • Zcash
        • ACL2-programming-language
        • Prime-fields
        • Java
        • C
        • Syntheto
        • Number-theory
        • Cryptography
        • Lists-light
        • File-io-light
        • Json
        • Built-ins
        • Solidity
        • Axe
        • Std-extensions
        • Htclient
        • Typed-lists-light
        • Arithmetic-light
      • X86isa
      • Execloader
      • Axe
    • Testing-utilities
    • Math
  • Prime-field-constraint-systems

Well-formedness

Well-formedness of PFCSes.

A constraint that is not an equality, i.e. that is an application of a named relation to some expressions, must reference a defined relation, and the number of argument expressions must match the number of parameters of the named relation. No two distinct relations may have the same name. The parameters of a named relation definition must be unique.

All these well-formedness conditions are formalized here.

Subtopics

Definition-list-wfp
Check if a list of definitions is well-formed.
Definition-wfp
Check if a definition is well-formed.
Constraint-wfp
Check if a constraint is well-formed, with respect to a list of relation definitions.
Constraint-list-wfp
Check if a list of constraints is well-formed, with respect to a list of relation definitions.
System-wfp
Check if a system is well-formed.