전체 글376 Lecture 5: Expert Evaluation 목차 Evaluation Evaluation is any type of test/measure to see how well something performs Most evaluations involve people, but some not (e.g. ML algorithms) Evaluation is part of the process, not just about the final product → Iterative Development Is it good enough with respect to X? How good is X? Is X better in system A or B? What effect does it have? What is wrong with respect to X? Evaluation.. 2024. 4. 1. Lecture 7-8: Mutation and State 목차 Learning Objectives - Explain how pointers work and how memory can be interpreted in different ways - Explain the differences between pass-by-reference and pass-by-value - Explain the differences between pure and impure languages - Understand the concept of stores and as an model for memory - Explain different methods to solve the problem of garbage - Implement a definitional interpreter with.. 2024. 4. 1. CPL 3: Function Interpretation and Environments 목차 Environments Basic Functions Environments represent the bindings available at different locations. Environment = list of bindings Bind is a case class (ADT) Bind(name: String, value: Value) E.g. Environment = [Bind("x", NumV(3)), Bind("y", NumV(5))] Difference between maps: environments allow for duplicate keys → allow access to shadowed bindings 1. add() def add(myEnv: Environment, name: Str.. 2024. 3. 31. Lecture 6: Environments and Scoping 목차 Learning Objectives - Explain what a "law" is - Explain how to verify that a programming language interpreter satisfies a law - Explain laws that uniquely characterize (simply-typed) functions What is a "Law"? An abstraction can be understood and defined independently of its underlying implementation Abstract definition = syntax + laws A law is an equation between two terms Example: → 왼쪽이 Syn.. 2024. 3. 29. Lecture 5: Functions, Substitution and Environments 목차 Learning Objectives• Explain how function application works by substituting parameters for arguments • Execute simple programs involving lambdas • Explain what name shadowing and name capture is • Implement recursion using only lambdas • Explain how environments are delayed substitutions Functions in ParetExamples Syntax (Lab/Extended) Example Example Function ApplicationParentheses aro.. 2024. 3. 28. Lecture 10: Automated Negotiation 목차 Automated Negotiation Intelligent software agents negotiate on behalf of their users. How can a software agent negotiate its user's behalf? Evaluating bids: reasoning on its user's preferences Employing a negotiation strategy → Which action the agent will take → How the agent will generate its offer → When the agent will accept the opponent's counter offer Communicating with other agent(s) ba.. 2024. 3. 27. Lecture 9: Negotiation Formalization 목차 Social Welfare (Fairness) Simple notion of social welfare: → That maximizes the sum of all Egalitarian point (aka Rawls Point): → maximize the minimum utility from the whole population. Utilitarian Point (aka Kalai-Smorodinsky Point): → closest point to the r_eq (대각선) When no equality utility solution exists Only three possible outcomes, and no one likes outcome B. (A and C are optimal fronti.. 2024. 3. 27. CPL 2-3: Higher Order Functions 목차 Abstract Syntax Tree (ASTs) context-free syntax Expr.NumExt = INT // integer literals Expr.TrueExt = [true] Expr.FalseExt = [false] Expr.IdExt = ID Expr.UnOpExt = [([UnOp] [Expr])] Expr.BinOpExt = [([BinOp] [Expr] [Expr])] UnOp.MIN = [-] UnOp.NOT = [not] UnOp.HEAD = [head] UnOp.TAIL = [tail] UnOp.ISNIL = [is-nil] UnOp.ISLIST = [is-list] BinOp.PLUS = [+] BinOp.MULT = [*] BinOp.MINUS = [-] BinO.. 2024. 3. 27. 이전 1 2 3 4 5 6 ··· 47 다음 반응형
