minikanren

问题 In miniKanren, succeed can be defined as (define succeed (== #t #t)) , and fail can be defined as (define fail (=== #t #f)) . But what about #s and #u as short forms of succeed and fail , as they appear in The Reasoned Schemer ? (define #s succeed) produces an error in Racket: Welcome to Racket v7.2. > (require Racket-miniKanren/miniKanren/mk) > (define #s succeed) ; readline-input:2:8: read-syntax: expected `(`, `[`, or `{` after `#s` [,bt ; for context] #<procedure:...iniKanren/mk.rkt:337:4

问题 In miniKanren, succeed can be defined as (define succeed (== #t #t)) , and fail can be defined as (define fail (=== #t #f)) . But what about #s and #u as short forms of succeed and fail , as they appear in The Reasoned Schemer ? (define #s succeed) produces an error in Racket: Welcome to Racket v7.2. > (require Racket-miniKanren/miniKanren/mk) > (define #s succeed) ; readline-input:2:8: read-syntax: expected `(`, `[`, or `{` after `#s` [,bt ; for context] #<procedure:...iniKanren/mk.rkt:337:4

问题 In miniKanren, succeed can be defined as (define succeed (== #t #t)) , and fail can be defined as (define fail (=== #t #f)) . But what about #s and #u as short forms of succeed and fail , as they appear in The Reasoned Schemer ? (define #s succeed) produces an error in Racket: Welcome to Racket v7.2. > (require Racket-miniKanren/miniKanren/mk) > (define #s succeed) ; readline-input:2:8: read-syntax: expected `(`, `[`, or `{` after `#s` [,bt ; for context] #<procedure:...iniKanren/mk.rkt:337:4

问题 In miniKanren, succeed can be defined as (define succeed (== #t #t)) , and fail can be defined as (define fail (=== #t #f)) . But what about #s and #u as short forms of succeed and fail , as they appear in The Reasoned Schemer ? (define #s succeed) produces an error in Racket: Welcome to Racket v7.2. > (require Racket-miniKanren/miniKanren/mk) > (define #s succeed) ; readline-input:2:8: read-syntax: expected `(`, `[`, or `{` after `#s` [,bt ; for context] #<procedure:...iniKanren/mk.rkt:337:4

问题 In miniKanren, succeed can be defined as (define succeed (== #t #t)) , and fail can be defined as (define fail (=== #t #f)) . But what about #s and #u as short forms of succeed and fail , as they appear in The Reasoned Schemer ? (define #s succeed) produces an error in Racket: Welcome to Racket v7.2. > (require Racket-miniKanren/miniKanren/mk) > (define #s succeed) ; readline-input:2:8: read-syntax: expected `(`, `[`, or `{` after `#s` [,bt ; for context] #<procedure:...iniKanren/mk.rkt:337:4

问题 In miniKanren, succeed can be defined as (define succeed (== #t #t)) , and fail can be defined as (define fail (=== #t #f)) . But what about #s and #u as short forms of succeed and fail , as they appear in The Reasoned Schemer ? (define #s succeed) produces an error in Racket: Welcome to Racket v7.2. > (require Racket-miniKanren/miniKanren/mk) > (define #s succeed) ; readline-input:2:8: read-syntax: expected `(`, `[`, or `{` after `#s` [,bt ; for context] #<procedure:...iniKanren/mk.rkt:337:4

问题 There is this paper: William E. Byrd, Eric Holk, Daniel P. Friedman, 2012 miniKanren, Live and Untagged Quine Generation via Relational Interpreters http://webyrd.net/quines/quines.pdf Which uses logic programming to find a Scheme Quine. The Scheme subset that is consider here does not only contain lambda abstraction and application, but also a little list processing by the following reduction, already translated to Prolog: [quote,X] ~~> X [] ~~> [] [cons,X,Y] ~~> [A|B], for X ~~> A and Y ~~>

问题 There is this paper: William E. Byrd, Eric Holk, Daniel P. Friedman, 2012 miniKanren, Live and Untagged Quine Generation via Relational Interpreters http://webyrd.net/quines/quines.pdf Which uses logic programming to find a Scheme Quine. The Scheme subset that is consider here does not only contain lambda abstraction and application, but also a little list processing by the following reduction, already translated to Prolog: [quote,X] ~~> X [] ~~> [] [cons,X,Y] ~~> [A|B], for X ~~> A and Y ~~>

问题 I started studying miniKanren with the book "The Reasoned Schemer - second edition" and the DrRacket scheme environment. I installed the "faster-minikanren" package, but the first examples of the book with the command run* (for example, (run* q #f) ) produce error messages such as run*: bad syntax in: (run* q #f) . Does this mean that the "faster-minikanren" package does not provide the right definition of minikanren? Or am I making a mistake? 回答1: As the readme says, you need to put (require

问题 When trying to understand core.logic throgh the API docs I come across Non-Relational goals and relational goals. I have no idea what this means in practice and why it is important to annotate goals if they are relational or not. Can you explain with example how the goals are used differently depending on if they are relational or not? 回答1: In order to explain what non-relational means we need to revisit what relational means. If you consider pure functions in functional programming, they