Philip Zucker on Twitter: "A fun usage of definite clause grammars https://t.co/LxAmJ0YuPd in prolog. A little category flavored combinatory logic prover. DCG tracks proof (almost a bussproof!) and allows for easy iterative deepening. https://t.co/OtCQm15JGD https://t.co/wO0FkMbWGO" / Twitter

A fun usage of definite clause grammars https:// metalevel.at/prolog/dcg in prolog. A little category flavored combinatory logic prover. DCG tracks proof (almost a bussproof!) and allows for easy iterative deepening. https:// ciao-lang.org/playground/#%25%20A%20combinatory%20logic%20theorem%20prover%0A%25%20DCGs%20make%20for%20nice%20tracking%20of%20proof%0A%25%20and%20allow%20for%20easy%20iterative%20deepening%0A%0Aprove(A%20%3E%20A)%20%20%20%20%20%20%20--%3E%20%5Bid%5D.%0Aprove(A%20/%5C%20_%20%3E%20A)%20%20--%3E%20%5Bfst%5D.%0Aprove(_%20/%5C%20B%20%3E%20B)%20%20--%3E%20%5Bsnd%5D.%0Aprove(A%20%3E%20A%20%5C/%20_)%20%20--%3E%20%5Binj1%5D.%0Aprove(B%20%3E%20_%20%5C/%20B)%20%20--%3E%20%5Binj2%5D.%0Aprove(false%20%3E%20_)%20%20%20--%3E%20%5Bi

A fun usage of definite clause grammars https:// metalevel.at/prolog/dcg in prolog. A little category flavored combinatory logic prover. DCG tracks proof (almost a bussproof!) and allows for easy iterative deepening. https:// ciao-lang.org/playground/#%25%20A%20combinatory%20logic%20theorem%20prover%0A%25%20DCGs%20make%20for%20nice%20tracking%20of%20proof%0A%25%20and%20allow%20for%20easy%20iterative%20deepening%0A%0Aprove(A%20%3E%20A)%20%20%20%20%20%20%20--%3E%20%5Bid%5D.%0Aprove(A%20/%5C%20_%20%3E%20A)%20%20--%3E%20%5Bfst%5D.%0Aprove(_%20/%5C%20B%20%3E%20B)%20%20--%3E%20%5Bsnd%5D.%0Aprove(A%20%3E%20A%20%5C/%20_)%20%20--%3E%20%5Binj1%5D.%0Aprove(B%20%3E%20_%20%5C/%20B)%20%20--%3E%20%5Binj2%5D.%0Aprove(false%20%3E%20_)%20%20%20--%3E%20%5Bi

Leave a Comment