GNU social JP
  • FAQ
  • Login
GNU social JPは日本のGNU socialサーバーです。
Usage/ToS/admin/test/Pleroma FE
  • Public

    • Public
    • Network
    • Groups
    • Featured
    • Popular
    • People

Embed Notice

HTML Code

Corresponding Notice

  1. Embed this notice
    Philip Trettner (artificialmind@fosstodon.org)'s status on Wednesday, 06-Nov-2024 23:29:45 JSTPhilip TrettnerPhilip Trettner
    in reply to
    • julesh

    @julesh I think that's basically what the Calculus of Inductive Constructions (as used in Coq / Lean) provides.

    The syntax only allows recursion on structurally smaller arguments.

    Recursion on inductive types is always well-founded and you can define inductive types for a well-foundedness relation, which basically means that all provably total functions are definable.

    The syntax ranges from "reasonable" (any obviously structural recursion requires no annotiation) to "custom proof required".

    In conversationabout 7 months ago from fosstodon.orgpermalink
  • Help
  • About
  • FAQ
  • TOS
  • Privacy
  • Source
  • Version
  • Contact

GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.

Creative Commons Attribution 3.0 All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.