https://cw.fel.cvut.cz/old/ 2026-05-05T15:30:39+0200 https://cw.fel.cvut.cz/old/ https://cw.fel.cvut.cz/old/lib/tpl/bulma-cw/images/favicon.ico text/html 2014-04-03T17:14:59+0200 Anonymous (anonymous@undisclosed.example.com) https://cw.fel.cvut.cz/old/courses/ae4b33flp/haskell?rev=1396538099&do=diff Haskell Lecture 6 types, definitions of functions, pattern matching, lists, basic built-in functions and operators: :load, :type (:t) fact :: Integer -> Integer fact n = if n == 0 then 1 else n*(fact (n-1)) fact1 n | n==0 = 1 | otherwise = n*(fact1 (n-1)) fact'' 0 = 1 fact'' n = n*(fact'' (n-1)) text/html 2017-02-13T11:44:51+0200 Anonymous (anonymous@undisclosed.example.com) https://cw.fel.cvut.cz/old/courses/ae4b33flp/lectures?rev=1486982691&do=diff Lectures — ae4b33flp ( home | lectures | tutorials | homework ) Scheme No. Date Topic 1. 23.2. Introduction to declarative programming languages. Comparison to classical imperative languages. Introduction to programming for artificial intelligence. 2. 2.3. Lisp and Scheme: basic language idioms, atoms, lists, recursion. text/html 2017-03-09T14:50:25+0200 Anonymous (anonymous@undisclosed.example.com) https://cw.fel.cvut.cz/old/courses/ae4b33flp/scheme?rev=1489067425&do=diff Scheme Lecture 1 define, quote, ', if, =, +, -, *, /, null?, car, cdr, c…r, cons, . (dotted pair), append (define (factorial n) (if (= n 0) 1 (* n (factorial (- n 1))) ) ) (define (last-element s) (if (null? (cdr s)) (car s) (last-element (cdr s)) )) text/html 2014-02-20T12:34:58+0200 Anonymous (anonymous@undisclosed.example.com) https://cw.fel.cvut.cz/old/courses/ae4b33flp/scheme_assignment_1?rev=1392896098&do=diff Scheme assignment 1 text/html 2017-03-17T01:30:47+0200 Anonymous (anonymous@undisclosed.example.com) https://cw.fel.cvut.cz/old/courses/ae4b33flp/scheme_tutorials?rev=1489710647&do=diff Tutorial 1 PLT DrRacket (define (is_even? ls) (if (null? ls) #t (is_odd? (cdr ls)) )) (define (is_odd? ls) (if (null? ls) #f (is_even? (cdr ls)) )) (define (is-even? ls) (if (null? ls) #t (if (null? (cdr ls)) #f (is-even? (cddr ls)) ))) text/html 2013-12-20T11:09:07+0200 Anonymous (anonymous@undisclosed.example.com) https://cw.fel.cvut.cz/old/courses/ae4b33flp/sidebar?rev=1387534147&do=diff ae4b33flp index ---------- AE4B33FLP - faculty web ---------- OPPA European Social Fund Prague & EU: We invest in your future. text/html 2017-02-14T11:43:41+0200 Anonymous (anonymous@undisclosed.example.com) https://cw.fel.cvut.cz/old/courses/ae4b33flp/start?rev=1487069021&do=diff Functional and Logic Programming — ae4b33flp ( home | lectures | tutorials | homework ) Summary This course introduces students into the techniques of functional programming in the LISP (or more precisely SCHEME) and HASKELL language and logic programming in the PROLOG language. Both languages are declarative in that the programmer symbolically describes the problem to be solved, rather than enumerating the exact sequence of actions to be taken. In PROLOG, one describes the problem by spec… text/html 2017-02-17T09:10:46+0200 Anonymous (anonymous@undisclosed.example.com) https://cw.fel.cvut.cz/old/courses/ae4b33flp/tutorials?rev=1487319046&do=diff Tutorials — ae4b33flp ( home | lectures | tutorials | homework ) No. Date Topic 1. 23.2 Scheme. First look at Scheme and its environment. Program debugging. Basic examples. Recursion. Accumulator.