izpis_h1_title_alt

Algoritem za izračun lambda izrazov na FPGA vezju
HABJAN, LOVRO (Author), Slivnik, Boštjan (Mentor) More about this mentor... This link opens in a new window

.pdfPDF - Presentation file, Download (1,13 MB)
MD5: CFD53E53FEBE4DDCFF0E9A6B3DC03CC3

Abstract
Diplomsko delo predstavi algoritem za izračun oziroma poenostavitev po- ljubnih lambda izrazov, ki je primeren za implementacijo z FPGA vezjem. Diplomsko delo najprej predstavi teorijo lambda računa, predstavitev lambda izraza v pomnilniku in splošni algoritem za izračun lambda izrazov. Rezultat diplomske naloge je algoritem, zasnovan kot deterministični končni avtomat, ki za svoje delovanje uporablja nabor registrov, sklad in pomnilnik in lahko izračuna poljuben lambda izraz. Ker je algoritem zasnovan kot determini- stični končni avtomat, je primeren za implementacijo z FPGA vezjem. Im- plementiran je v programskem jeziku C in omogoča testiranje in beleženje podatkov o izvajanju.

Language:Slovenian
Keywords:lambda račun, funkcijsko programiranje, končni avtomat, FPGA
Work type:Bachelor thesis/paper (mb11)
Organization:FRI - Faculty of computer and information science
Year:2020
COBISS.SI-ID:22576131 This link opens in a new window
Views:219
Downloads:106
Metadata:XML RDF-CHPDL DC-XML DC-RDF
 
Average score:(0 votes)
Your score:Voting is allowed only to logged in users.
:
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

Secondary language

Language:English
Title:Algorithm for reducing lambda expressions on FPGA circuit
Abstract:
The diploma thesis presents an algorithm for solving an arbitrary lambda expression that is possible to implement with an FPGA circuit. The diploma thesis covers the theory of the lambda calculus, memory representation of a lambda expression and a general algorithm for solving lambda expressions. The result of the diploma thesis is an algorithm, designed as a deterministic finite automaton, which uses a set of registers, a stack and memory to solve any lambda expression. Because the algorithm is designed as a deterministic finite automaton, it can be easily implemented with an FPGA circuit. The algorithm is implemented in the C programming langugage and supports testing and measuring runtime data.

Keywords:lambda calculus, functional programming, finite automaton, FPGA

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back