Protrace: Effective Recursion Tracing and Debugging Library for Functional Programming Style in Common Lisp

2010 ◽  
pp. 468-475
Author(s):  
Konrad Grzanek ◽  
Andrzej Cader
Keyword(s):  
Functional Programming ◽  
Common Lisp

Porting Pan I to Allegro COMMON LISP

1988 ◽  
Author(s):  
Darrin J. Lane
Keyword(s):  
Common Lisp

Editorial of Special Issue Trends in Functional Programming 2011/12

2015 ◽  
Vol 44 ◽  
pp. 141-142
Author(s):  
Hans-Wolfgang Loidl ◽  
Ricardo Peña
Keyword(s):  
Functional Programming ◽  
Special Issue

The embeddable Common Lisp

1995 ◽  
Vol VIII (1) ◽  
pp. 30-41
Author(s):  
Guiseppe Attardi
Keyword(s):  
Common Lisp

The Alonzo functional programming language

1989 ◽  
Vol 24 (9) ◽  
pp. 152-157 ◽  
Author(s):  
J. D. Ramsdell
Keyword(s):  
Programming Language ◽  
Functional Programming ◽  
Functional Programming Language

scholarly journals Dynamic game semantics

2020 ◽  
pp. 1-60
Author(s):  
Norihiro Yamada ◽  
Samson Abramsky
Keyword(s):  
Programming Languages ◽  
Functional Programming ◽  
Operational Semantics ◽  
Dynamic Game ◽  
Standard Interpretation ◽  
Functional Programming Languages ◽  
Game Semantics ◽  
Wide Range ◽  
Cartesian Closed Categories ◽  
Cartesian Closed

Abstract The present work achieves a mathematical, in particular syntax-independent, formulation of dynamics and intensionality of computation in terms of games and strategies. Specifically, we give game semantics of a higher-order programming language that distinguishes programmes with the same value yet different algorithms (or intensionality) and the hiding operation on strategies that precisely corresponds to the (small-step) operational semantics (or dynamics) of the language. Categorically, our games and strategies give rise to a cartesian closed bicategory, and our game semantics forms an instance of a bicategorical generalisation of the standard interpretation of functional programming languages in cartesian closed categories. This work is intended to be a step towards a mathematical foundation of intensional and dynamic aspects of logic and computation; it should be applicable to a wide range of logics and computations.

scholarly journals Introducing computer science using a breadth-first approach and functional programming

2000 ◽  
Vol 32 (1) ◽  
pp. 180-184 ◽  
Author(s):  
Scott Vandenberg ◽  
Michael Wollowski
Keyword(s):  
Computer Science ◽  
Functional Programming
Sign in / Sign up

Export Citation Format

Share Document